Sparsity: Optimization framework for sparse matrix kernels

International Journal of High Performance Computing Applications

Volumn 18, Issue 1, 2004, Pages 135-158

  Im, Eun Jin ^a   Yelick, Katherine ^b   Vuduc, Richard ^b  

^a Kookmin University   (South Korea)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Memory hierarchy; Performance tuning; Sparse matrix

Indexed keywords

CODES (SYMBOLS); COMPUTER ARCHITECTURE; FINITE ELEMENT METHOD; HEURISTIC METHODS; IMAGE PROCESSING; INFORMATION RETRIEVAL; MATRIX ALGEBRA; OPTIMIZATION; PROGRAM COMPILERS; SHIFT REGISTERS; SPEED CONTROL; VECTORS;

MEMORY HIERARCHY; PERFORMANCE TUNING; SPARSE MATRIX; SPARSITY;

BUFFER STORAGE;

EID: 1542501019     PISSN: 10943420     EISSN: None     Source Type: Journal    
DOI: 10.1177/1094342004041296     Document Type: Article

References (28)

1. Bai, Z., Demmel, J., Dongarra, J., Ruge, A., and van der Vorst, H., editors. 2000. Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, SIAM, Philadelphia, PA.
2. Baker, A. H., Jessup, E. R., and Manteuffel, T. January 2003. A technique for accelerating the convergence of restarted GMRES, Technical Report CU-CS-045-03, University of Colorado, Department of Computer Science.
3. Balay, S., Gropp, W. D., McInnes, L. C., and Smith, B. F. 2000. PETSc 2.0 users manual, Technical Report ANL-95/11 - Revision 2.0.28, Argonne National Laboratory.
4. Berry, M. W., Dumais, S. T., and O'Brien, G. W. 1995. Using linear algebra for intelligent information retrieval. SIAM Review 37 (4):573-595.
5. Bik, A. J. C. 1996. Compiler support for sparse matrix computations, PhD thesis, Leiden University.
6. Bilmes, J. A., Asanovic, K., Demmel, J., Chin, C., and Lam, D. July 1997. Optimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology. In International Conference on Supercomputing, Vienna, Austria.
7. BLAST Forum. October 1999. Documentation for the Basic Linear Algebra Subprograms (BLAS), http://www.netlib.org/blas/blast-forum.
8. Golub, G. H. and Underwood, R. 1977. The block Lanczos method for computing eigenvalues. In Mathematical Sotware III, J. R. Rice, editor, Academic, New York, pp. 361-377.
9. Goto, K. and van de Geijn, R. November 2002. On reducing TLB misses in matrix multiplication, Technical Report TR-2002-55, University of Texas at Austin.
10. Grimes, R. G., Lewis, J. G., and Simon, H. D. 1994. A shifted block Lanczos algorithm for solving sparse symmetric eigenvalue problems. SIAM Journal on Matrix Analysis and Applications 15:228-272.
11. Gupta, K. K. and Lawson, C. L. 1988. Development of a block Lanczos algorithm for free vibration analysis of spinning structures. International Journal for Numerical Methods in Engineering 26:1029-1037.
12. Hennesy, J. L. and Patterson, D. A. 1996. Computer Architecture: A Quantitative Approach, 2nd edition, Morgan Kaufman, San Mateo, CA.
13. Heras, D. B., Perez, V. B., Dominguez, J. C. C., and Rivera, F. F. 1999. Modeling and improving locality for irregular problems: sparse matrix-vector product on cache memories as a case study. In HPCN Europe, Amsterdam, The Netherlands, pp. 201-210.
14. Im, E.-J. May 2000. Optimizing the performance of sparse matrix-vector multiplication, Ph.D. Thesis, University of California at Berkeley.
15. Im, E.-J. and Yelick, K. March 1999. Optimizing sparse matrix vector multiplication on SMPs. In 9th SIAM Conference on Parallel Processing for Scientific Computing, San Antonio, TX.
16. Kotlyar, V., Pingali, K, and Stodghill, P. 1997. Compiling parallel code for sparse matrix applications. In Proceedings of Supercomputing San Jose, CA.
17. Lam, M. S., Rothberg, E. E., and Wolf, M. E. April 1991. The cache performance and optimizations of blocked algorithms. In Proceedings of the 4th International Conference on Architectural Support for Programming Languages and Operating Systems Santa Clara, CA.
18. Lehoucq, R. and Maschhoff, K. 1997. Implementation of an implicitly restarted block Arnoldi method, Preprint MCS-P649-0297, Argonne National Lab.
19. Marques, O. A. 1995. BLZPACK: Description and User's guide, Technical Report TR/PA/95/30, CERFACS.
20. Oliker, L. Li, X., Heber, G., and Biswas, R. 2000. Ordering unstructured meshes for sparse matrix computations on leading parallel systems. In Parallel and Distributed Processing, 15 IPDPS 2000 Workshops, Lecture Notes in Computer Science Vol. 1800, Springer-Verlag, Berlin, pp. 497-503.
21. Pinar, A. and Heath, M. 1999. Improving performance of sparse matrix-vector multiplication. In Proceedings of Super-computing Portland, OR.
22. Pozo, R. and Remington, K. 1997. NIST Sparse BLAS, http://math.nist.gov//spblas.
23. Pugh, W. and Shpeisman, T. August 1998. Generation of efficient code for sparse matrix computations. In Proceedings of the 11th Workshop on Languages and Compilers for Parallel Computing, LNCS, Springer-Verlag, Berlin.
24. Sadkane, M. 1993a. A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices. Journal of Numerical Mathematics 64:181-193.
25. Sadkane, M. 1993b. Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems. Journal of Numerical Mathematics 64:195-211.
26. Shi, J. and Malik, J. January 1998. Motion segmentation and tracking using normalized cuts. In International Conference on Computer Vision Bombay, India.
27. Toledo, S. March 1997. Improving memory-system performance of sparse matrix-vector multiplication. In Proceedings of the 8th SIAM Conference on Parallel Processing for Scientific Computing Minneapolis, MN.
28. Whaley, R. C, Petitet, A., and Dongarra, J. J. September 2000. Automated empirical optimization of software and the ATLAS project, http://math-atlas.sourceforge.net.