Title
Improving the locality of the sparse matrix-vector product on shared memory multiprocessors
Abstract
We extend a model of locality and the subsequent process of locality improvement previously developed for the case of sparse algebra codes in monoprocessors to the case of NUMA shared memory multiprocessors (SMPs). In particular the product of a sparse matrix by a dense vector (SpM×V) is studied. In the model, locality is established at run-time considering parameters that describe the structure of the sparse matrix involved in the computations. The problem of increasing the locality is formulated as a graph problem, whose solution indicates some appropriate reordering of rows and columns of the sparse matrix. The reordering algorithms were tested for a broad set of matrices. We have also performed a comparison with other reordering algorithms. The results lead to general conclusions about improving SMP performance for other sparse algebra codes.
Year
DOI
Venue
2004
10.1109/EMPDP.2004.1271429
PDP
Keywords
Field
DocType
mathematics computing,matrix multiplication,shared memory systems,sparse matrices,NUMA shared memory multiprocessors,dense vector,graph problem,reordering algorithms,sparse algebra codes,sparse matrix-vector product locality improvement
Row and column spaces,Locality,Shared memory,Computer science,Matrix (mathematics),Parallel computing,Sparse approximation,Matrix multiplication,Sparse matrix,Distributed computing,Matrix-free methods
Conference
ISSN
ISBN
Citations 
1066-6192
0-7695-2083-9
20
PageRank 
References 
Authors
1.32
8
4
Name
Order
Citations
PageRank
Juan Carlos Pichel1406.66
Heras, D.B.2402.02
Cabaleiro, J.C.3232.45
Francisco F. Rivera417726.17