Exact sparse matrix-vector multiplication on GPU's and multicore architectures

Authors:
Brice Boyer;Jean-Guillaume Dumas;Pascal Giorgi
Affiliations:
Université de Grenoble, BP Grenoble, France;Université de Grenoble, BP Grenoble, France;Université Montpellier, Montpellier, France
Venue:
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Year:
2010

Citing 17
Cited 3

Solving sparse linear equations over finite fields

IEEE Transactions on Information Theory
On fast multiplication of polynomials over arbitrary algebras

Acta Informatica
Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm

Mathematics of Computation
Factoring high-degree polynomials by the black box Berlekamp algorithm

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems

Mathematics of Computation
Modern computer algebra

Modern computer algebra
On Wiedemann's Method of Solving Sparse Linear Systems

AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Finite field linear algebra subroutines

Proceedings of the 2002 international symposium on Symbolic and algebraic computation
On the complexity of polynomial matrix computations

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
A block Wiedemann rank algorithm

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
A New Approach for Accelerating the Sparse Matrix-Vector Multiplication

SYNASC '06 Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Parallel computation of the rank of large sparse matrices from algebraic K-theory

Proceedings of the 2007 international workshop on Parallel symbolic computation
Q-adic transform revisited

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages

ACM Transactions on Mathematical Software (TOMS)
Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Implementing sparse matrix-vector multiplication on throughput-oriented processors

Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Fast sparse matrix-vector multiplication by exploiting variable block structure

HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications

Solving bivariate polynomial systems on a GPU

ACM Communications in Computer Algebra
Iterative sparse Matrix-Vector multiplication for integer factorization on GPUs

Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
Block Wiedemann algorithm on multicore architectures

ACM Communications in Computer Algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose different implementations of the sparse matrix-dense vector multiplication (SpMV) for finite fields and rings Z /m Z. 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 library and a new parallelisation of the sigma-basis algorithm in a parallel block Wiedemann rank implementation over finite fields.