Block Wiedemann algorithm on multicore architectures
| Autor: | Bastien Vialla |
|---|---|
| Přispěvatelé: | Exact Computing (ECO), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), ANR-11-BS02-0013,HPAC,Calcul Algébrique Haute-Performance(2011) |
| Rok vydání: | 2014 |
| Předmět: |
[INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]
Range (mathematics) Kernel (linear algebra) Multi-core processor Block Wiedemann algorithm ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION Linear system General Medicine Parallel computing Algorithm Sparse matrix Mathematics Block (data storage) |
| Zdroj: | ACM Communications in Computer Algebra ACM Communications in Computer Algebra, Association for Computing Machinery (ACM), 2014, 47 (3/4), pp.102-103. ⟨10.1145/2576802.2576814⟩ |
| ISSN: | 1932-2240 |
| DOI: | 10.1145/2576802.2576814 |
| Popis: | International audience; Solving a linear system with large sparse matrices is a com-putational kernel used in a wide range of applications. The block version of Wiedemann’s algorithm proposed in [Wiedemann 1986] takes advantage of the sparsity to achieve better performance.Our objectives in this poster is to provide an efficient implementation of block Wiedemann algorithm on NUMA multicores architectures. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|