Abstract
We analyze single-node performance of sparse matrix-vector multiplication by investigating issues of data locality and fine-grained parallelism. We examine the data-locality characteristics of the compressed-sparse-row representation and consider improvements in locality through matrix permutation. Motivated by potential improvements in fine-grained parallelism, we evaluate modified sparse-matrix representations. The results lead to general conclusions about improving single-node performance of sparse matrix-vector multiplication in parallel libraries of sparse iterative solvers.
| Original language | English |
|---|---|
| Pages | 66-71 |
| Number of pages | 6 |
| State | Published - 1997 |
| Externally published | Yes |
| Event | Proceedings of the 1997 4th International Conference on High Performance Computing, HiPC - Bangalore, India Duration: Dec 18 1997 → Dec 21 1997 |
Conference
| Conference | Proceedings of the 1997 4th International Conference on High Performance Computing, HiPC |
|---|---|
| City | Bangalore, India |
| Period | 12/18/97 → 12/21/97 |