Block Wiedemann algorithm on multicore architectures
Overview & Synopsis
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.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Block Wiedemann algorithm on multicore architectures |
|---|---|
| Author / Organization | Bastien Vialla |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2014 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-16441 |
| Original Source Link | Visit Source Page on hal.science » |