Perfomance models for blocked sparse matrix-vector multiplication kernels

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2009, Pages 356-364

  Karakasis, Vasileios ^a   Goumas, Georgios ^a   Koziris, Nectarios ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

Blocking; Performance models; Sparse matrix vector multiplication

Indexed keywords

BLOCKING METHOD; BLOCKING PERFORMANCE; COMPUTATIONAL KERNELS; HIGH DEMAND; INDEXING STRUCTURES; INPUT MATRICES; MEMORY ACCESS; MEMORY BANDWIDTHS; MEMORY SUBSYSTEMS; OPTIMIZATION TECHNIQUES; PERFORMANCE MODEL; PREFETCHING; SHAPE AND SIZE; SPARSE MATRICES; SPARSE MATRIX-VECTOR MULTIPLICATION; STORAGE FORMATS;

KNOWLEDGE BASED SYSTEMS; VECTORS;

MATRIX ALGEBRA;

EID: 77951427635     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2009.21     Document Type: Conference Paper

References (19)

1. R. C. Agarwal, F. G. Gustavson, and M. Zubair. A high performance algorithm using pre-processing for the sparse matrix-vector multiplication. In Proceedings of the 1992 ACM/IEEE conference on Supercomputing, pages 32-41, Minneapolis, MN, United States, 1992. IEEE Computer Society.
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, 1994.
3. A. Buttari, V. Eijkhout, J. Langou, and S. Filippone. Performance optimization and modeling of blocked sparse kernels. International Journal of High Performance Computing Applications, 21(4):467-484, 2007.
4. T. Davis. The University of Florida sparse matrix collection. NA Digest, vol. 97, no. 23, June 1997. http://www.cise.ufl. edu/research/sparse/matrices.
5. G. Goumas, K. Kourtis, N. Anastopoulos, V. Karakasis, and N. Koziris. Understanding the performance of sparse matrix-vector multiplication. In Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network- Based Processing (PDP 2008), Toulouse, France, 2008. IEEE Computer Society.
6. W. D. Gropp, D. K. Kaushik, D. E. Keyes, and B. F. Smith. Toward realistic performance bounds for implicit CFD codes. In International Parallel CFD 1999 Conference, Williamsburg, VA, United States, 1999.
7. E. Im and K. Yelick. Optimizing sparse matrix-vector multiplication on SMPs. In Ninth SIAM Conference on Parallel Processing for Scientific Computing. SIAM, March 1999.
8. E.-J. Im and K. A. Yelick. Optimizing sparse matrix computations for register reuse in SPARSITY. In Proceedings of the International Conference on Computational Sciences- Part I, pages 127-136. Springer-Verlag, 2001.
9. V. Karakasis, G. Goumas, and N. Koziris. Exploring the effect of block shapes on the performance of sparse kernels. In IEEE International Symposium on Parallel and Distributed Processing (Workshop on Parallel and Distributed Scientific and Engineering Computing with Applications), Rome, Italy, 2009. IEEE.
10. K. Kourtis, G. Goumas, and N. Koziris. Improving the performance of multithreaded sparse matrix-vector multiplication using index and value compression. In Proceedings of the 2008 37th International Conference on Parallel Processing, Portland, Oregon, United States, 2008. IEEE Computer Society.
11. J. D. McCalpin. STREAM: Sustainable memory bandwidth in high performance computing, 1995. http://www.cs.virginia. edu/stream
12. A. Pinar and M. T. Heath. Improving performance of sparse matrix-vector multiplication. In Proceedings of the 1999 ACM/IEEE conference on Supercomputing, Portland, OR, United States, 1999. ACM.
13. Y. Saad. SPARSKIT: A basic tool kit for sparse matrix computations, 1994.
14. O. Temam andW. Jalby. Characterizing the behavior of sparse algorithms on caches. In Proceedings of the 1992 ACM/IEEE conference on Supercomputing, pages 578-587, Minneapolis, MN, United States, 1992. IEEE Computer Society.
15. R. Vuduc. Automatic Performance Tuning of Sparse Matrix Kernels. PhD thesis, University of California, Berkeley, 2003.
16. R. Vuduc, J. W. Demmel, K. A. Yelick, S. Kamil, R. Nishtala, and B. Lee. Performance optimizations and bounds for sparse matrix-vector multiply. In Proceedings of the 2002 ACM/IEEE conference on Supercomputing, pages 1-35, Baltimore, MD, United States, 2002. IEEE Computer Society.
17. R. W. Vuduc and H.-J. 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 Berlin/Heidelberg, 2005.
18. J. Willcock and A. Lumsdaine. Accelerating sparse matrix computations via data compression. In Proceedings of the 20th annual International conference on Supercomputing, pages 307-316, Cairns, Queensland, Australia, 2006. ACM.
19. S. Williams, L. Oilker, R. Vuduc, J. Shalf, K. Yelick, and J. Demmel. Optimization of sparse matrix-vector multiplication on emerging multicore platforms. In Proceedings of the 2007 ACM/IEEE conference on Supercomputing, Reno, NV, United States, 2007. ACM.