Understanding the performance of sparse matrix-vector multiplication

Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing, PDP 2008

Volumn , Issue , 2008, Pages 283-292

  Goumas, Georgios ^a   Kourtis, Kornilios ^a   Anastopoulos, Nikos ^a   Karakasis, Vasileios ^a   Koziris, Nectarios ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMMODITY HARDWARE; MICRO-ARCHITECTURES; OPTIMIZATION PROCESSES; PERFORMANCE ISSUES; SPARSE MATRIX-VECTOR MULTIPLICATION;

EXPERIMENTS; LEAD; ONLINE SEARCHING; OPTIMIZATION; VECTORS;

MATRIX ALGEBRA;

EID: 47349103843     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PDP.2008.41     Document Type: Conference Paper

References (21)

1. R. C. Agarwal, F. G. Gustavson, and M. Zubair. A high performance algorithm using pre-processing for the sparse matrix-vector multiplication. In Supercomputing '92, pages 32-41, Minn., MN, Nov. 1992. IEEE.
2. R. Barrett, M. Berry, T. F. Chan, J. Demmel, J. M. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. V. der Vorst. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM, Philadelphia, 1994.
3. A. Buttari, V. Eijkhout, J. Langou, and S. Filippone. Performance optimization and modeling of blocked sparse kernels. Technical Report ICL-UT-04-05, Innovative Computing Laboratory, University of Tennessee, 2005.
4. T. Davis. University of Florida Sparse Matrix Collection, http://www.cise.ufl.edu/research/sparse/matrices. NA Digest, vol. 97, no. 23, June 1997.
5. R. Geus and S. Röllin. Towards a fast parallel sparse matrixvector multiplication. In Parallel Computing: Fundamentals and Applications, International Conference ParCo, pages 308-315. Imperial College Press, 1999.
6. W. Gropp, D. Kaushik, D. Keyes, and B. Smith. Toward realistic performance bounds for implicit cfd codes. 1999.
7. E. Im. Optimizing the performance of sparse matrix-vector multiplication. PhD thesis, University of California, Berkeley, May 2000.
8. E. Im and K. Yelick. Optimizing sparse matrix computations for register reuse in SPARSITY. Lecture Notes in Computer Science, 2073:127-136, 2001.
9. J. Mellor-Crummey and J. Garvin. Optimizing sparse matrix-vector product computations using unroll and jam. International Journal of High Performance Computing Applications, 18(2):225, 2004.
10. G. Paolini and G. Radicati di Brozolo. Data structures to vectorize CG algorithms for general sparsity patterns. BIT Numerical Mathematics, 29(4):703-718, 1989.
11. J. C. Pichel, D. B. Heras, J. C. Cabaleiro, and F. F. Rivera. Improving the locality of the sparse matrix-vector product on shared memory multiprocessors. In PDP, pages 66-71. IEEE Computer Society, 2004.
12. J. C. Pichel, D. B. Heras, J. C. Cabaleiro, and F. F. Rivera. Performance optimization of irregular codes based on the combination of reordering and blocking techniques. Parallel Computing, 31(8-9):858-876, 2005.
13. A. Pinar and M. T. Heath. Improving performance of sparse matrix-vector multiplication. In Supercomputing'99, Portland, OR, Nov. 1999. ACM SIGARCH and IEEE.
14. Y. Saad. Sparskit: A basic tool kit for sparse matrix computation. Technical report, Center for Supercomputing Research and Development, University of Illinois at Urbana Champaign, 1990.
15. Y. Saad. Iterative Methods for Sparse Linear Systems. SIAM, Philadelphia, PA, USA, 2003.
16. O. Temam and W. Jalby. Characterizing the behavior of sparse algorithms on caches. In Supercomputing '92, pages 578-587, Minnesota., MN, Nov. 1992. IEEE.
17. S. Toledo. Improving the memory-system performance of sparse-matrix vector multiplication. IBM Journal of Research and Development, 41(6):711-725, 1997.
18. R. Vuduc, J. Demmel, K. Yelick, S. Kamil, R. Nishtala, and B. Lee. Performance optimizations and bounds for sparse matrix-vector multiply. In Supercomputing, Baltimore, MD, Nov. 2002.
19. R. W. Vuduc and H. Moon. Fast sparse matrix-vector multiplication by exploiting variable block structure. In High Performance Computing and Communications, volume 3726 of Lecture Notes in Computer Science, pages 807-816. Springer, 2005.
20. J. White and P. Sadayappan. On improving the performance of sparse matrix-vector multiplication. In 4th International Conference on High Performance Computing (HiPC '97), 1997.
21. J. Willcock and A. Lumsdaine. Accelerating sparse matrix computations via data compression. In ICS '06: Proceedings of the 20th annual international conference on Supercomputing, pages 307-316, New York, NY, USA, 2006. ACM Press.