Fast sparse matrix-vector multiplication by exploiting variable block structure

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3726 LNCS, Issue , 2005, Pages 807-816

  Vuduc, Richard W ^a   Moon, Hyun Jin ^b  

^a LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK COMPRESSED SPARSE ROW (BCSR); RECTANGULAR BLOCKS; SPARSE MATRIX-VECTOR MULTIPLICATION (SPMV); SUPERSCALAR MACHINES;

BANDWIDTH; BUFFER STORAGE; COMPUTER SIMULATION; DATA STRUCTURES; FINITE ELEMENT METHOD; MATRIX ALGEBRA;

DATABASE SYSTEMS;

EID: 33646389518     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11557654_91     Document Type: Conference Paper

References (19)

1. A. H. Baker, E. R. Jessup, and T. Manteuffel. A technique for accelerating the convergence of restarted GMRES. Technical Report CU-CS-045-03, University of Colorado, Dept. of Computer Science, January 2003.
2. 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, Knoxville, 2005.
3. E. D'Azevedo, M. R. Fahey, and R. T. Mills. Vectorized sparse matrix multiply for compressed sparse row storage. In Proceedings of the International Conference on Computational Science, LNCS 3514, pages 99-106, Atlanta, GA, USA, May 2005. Springer.
4. R. Geus and S. Röllin. Towards a fast parallel sparse matrix-vector multiplication. In E. H. D'Hollander, J. R. Joubert, F. J. Peters, and H. Sips, editors, Proceedings of the International Conference on Parallel Computing (ParCo), pages 308-315. Imperial College Press, 1999.
5. E.-J. Im. Optimizing the performance of sparse matrix-vector multiplication. PhD thesis, University of California, Berkeley, May 2000.
6. E.-J. Im, K. Yelick, and R. Vuduc. Sparsity. Optimization framework for sparse matrix kernels. International Journal of High Performance Computing Applications, 18(1):135-158, 2004.
7. B. C. Lee, R. Vuduc, J. Demmel, and K. Yelick. Performance models for evaluation and automatic tuning of symmetric sparse matrix-vector multiply. In Proceedings of the International Conference on Parallel Processing, Montreal, Canada, August 2004.
8. J. Mellor-Crummey and J. Garvin. Optimizing sparse matrix vector multiply using unroll-and-jam. In Proceedings of the Los Alamos Computer Science Institute Third Annual Symposium, Santa Fe, NM, USA, October 2002.
9. R. Nishtala, R. Vuduc, J. Demmel, and K. Yelick. When cache blocking sparse matrix vector multiply works and why. In Proceeding's of the PARA'04 Workshop on the State-of-the-art in Scientific Computing', Copenhagen, Denmark, June 2004.
10. A. Pinar and M. Heath. Improving performance of sparse matrix-vector multiplication. In Proceedings of Supercomputing, 1999.
11. K. Remington and R. Pozo. NIST Sparse BLAS: User's Guide. Technical report, NIST, 1996. gams.nist.gov/spblas.
12. Y. Saad. SPARSKIT: A basic toolkit for sparse matrix computations, 1994. www.cs.umn.edu/Research/arpa/SPARSKIT/sparskit.html.
13. O. Temam and W. Jalby. Characterizing the behavior of sparse algorithms on caches. In Proceedings of Supercomputing '92, 1992.
14. S. Toledo. Improving memory-system performance of sparse matrix-vector multiplication. In Proceedings of the 8th SIAM Conference on Parallel Processing for Scientific Computing, March 1997.
15. V. Vassilevska and A. Pinar. Finding nonoverlapping dense blocks of a sparse matrix. Technical Report LBNL-54498, Lawrence Berkeley National Laboratory, Berkeley, CA, USA, 2004.
16. R. Vuduc. Automatic performance tuning of sparse matrix kernels. PhD thesis, University of California, Berkeley, Berkeley, CA, USA, December 2003.
17. R. Vuduc, J. Demmel, and K. Yelick. OSKI: An interface for a self-optimizing library of sparse matrix kernels, 2005. bebop.cs.berkeley.edu/ oski.
18. 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 Supercomputing, Baltimore, MD, USA, November 2002.
19. R. Vuduc and H.-J. Moon. Fast sparse matrix-vector multiplication by exploiting variable blocks structure. Technical Report UCRL-TR-213454, Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, CA, USA, July 2005.