Name
Title | ||
|---|---|---|
A Comparative Study of Blocking Storage Methods for Sparse Matrices on Multicore Architectures |
Abstract | ||
|---|---|---|
Sparse Matrix-Vector multiplication (SpMV) is a very challenging computationalkernel, since its performance depends greatly on both the input matrix and theunderlying architecture. The main problem of SpMV is its high demands on memorybandwidth, which cannot yet be abudantly offered from modern commodityarchitectures. One of the most promising optimization techniques for SpMV isblocking, which can reduce the indexing structures for storing a sparse matrix,and therefore alleviate the pressure to the memory subsystem. In this paper, westudy and evaluate a number of representative blocking storage formats on a setof modern microarchitectures that can provide up to 64 hardware contexts. Thepurpose of this paper is to present the merits and drawbacks of each method inrelation to the underlying microarchitecture and to provide a consistentoverview of the most promising blocking storage methods for sparse matrices thathave been presented in the literature. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/CSE.2009.223 | CSE (1) |
Keywords | DocType | Citations |
spmv isblocking,storage method,setof modern microarchitectures,-sparse matrix-vector multiplication,multicore architectures,sparse matrix-vector multiplication,modern commodityarchitectures,blocking storage methods,blocking,sparse matrix,comparative study,sparse matrices,input matrix,storage format,promising optimization technique,challenging computationalkernel,per- formance evaluation,matrix decomposition,memory bandwidth,matrix multiplication,indexing,bandwidth,data mining,vectors,kernel | Conference | 13 |
PageRank | References | Authors |
0.89 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vasileios Karakasis | 1 | 138 | 10.24 |
| Georgios Goumas | 2 | 268 | 22.03 |
| N. Koziris | 3 | 1015 | 107.53 |