DMCA
Exact sparse matrix-vector multiplication on gpu’s and multicore architectures (2010)
| Venue: | In Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, PASCO ’10 |
| Citations: | 5 - 2 self |
BibTeX
@INPROCEEDINGS{Boyer10exactsparse,
author = {Brice Boyer and Jean-guillaume Dumas and Pascal Giorgi},
title = {Exact sparse matrix-vector multiplication on gpu’s and multicore architectures},
booktitle = {In Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, PASCO ’10},
year = {2010},
pages = {80--88},
publisher = {ACM}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We propose different implementations of the sparse matrix–dense vec-tor multiplication (SpMV) for finite fields and rings Z /mZ. We take advantage of graphic card processors (GPU) and multi-core architectures. Our aim is to improve the speed of SpMV in the LinBox library, and henceforth the speed of its black box algorithms. Besides, we use this and a new parallelization of the sigma-basis algorithm in a parallel block Wiedemann rank implementation over finite fields. 1
Keyphrases
exact sparse matrix-vector multiplication multicore architecture finite field graphic card processor different implementation black box algorithm sparse matrix dense vec-tor multiplication new parallelization multi-core architecture parallel block wiedemann rank implementation sigma-basis algorithm ring mz linbox library
