Performance models for evaluation and automatic tuning of symmetric sparse matrix-vector multiply

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2004, Pages 169-176

  Lee Benjamin, Benjamin C ^a   Vuduc, Richard W ^a   Demmel, James W ^a   Yelick, Katherine A ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; BUFFER STORAGE; CODES (SYMBOLS); COMPUTER SCIENCE; FINITE ELEMENT METHOD; OPTIMIZATION; STORAGE ALLOCATION (COMPUTER); TUNING; VECTORS;

AUTOMATIC TUNING; MATRIX MULTIPLICATION; PERFORMANCE MODELS; SPARSE MATRIX-VECTORS;

MATRIX ALGEBRA;

EID: 10044248780     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. E.-J. Im., K. Yelick, R. Vuduc. SPARSITY: Framework for Optimizing Sparse Matrix-Vector Multiply. International Journal of High Performance Computing Applications, 18(1), 2004.
2. R. Vuduc. Automatic Performance Tuning of Sparse Matrix Kernels. PhD thesis, U.C. Berkeley, Dec. 2003.
3. B. Lee, R. Vuduc, J. Demmel, K. Yelick, M. de Lorimier, L. Zhong. Performance Optimizations and Bounds for Sparse Symmetric Matrix-Multiple Vector Multiply. Technical Report UCB/CSD-03-1297, University of California, Berkeley, November 25, 2003.
4. R. Vuduc, J. Demmel, K. Yelick, S. Kamil, R. Nishtala, B. Lee. Performance Optimizations and Bounds for Sparse Matrix-Vector Multiply. In Supercomputing,Baltimore, MD, November 2002.
5. E.-J. Im. Optimization the Performance of Sparse Matrix-Vector Multiplication. PhD thesis, U.C. Berkeley, May 2000.
6. E.-J. Im and K. Yelick. Optimizing sparse matrix vector multiplication on SMPs. In Proc. of the 9th SIAM Conf. on Parallel Processing for Sci. Comp., March 1999.
7. E.-J. Im and K. A. Yelick. Optimizing sparse matrix-vector multiplication for register reuse. In Proceedings of the International Conference on Computational Science, May 2001.
8. J. Bilmes, K. Asanović, C. Chin, and J. Demmel. Optimizing matrix multiply using PHiPAC: a Portable, High-Performance, ANSI C coding methodology. In Proc. of the Int'l Conf. on Supercomputing, Vienna, Austria, July 1997.
9. C. Whaley and J. Dongarra. Automatically tuned linear algebra software. In Proc. of Supercomp., 1998.
10. R. H. Saavedra-Barrera. CPU Performance Evaluation and Execution Time Prediction Using Narrow Spectrum Benchmarking. PhD thesis, U.C. Berkeley, February 1992.
11. A. Snavely, N. Wolter, and L. Carrington. Modeling Application Performance by Convolving Machine Signatures with Application Profiles. In Proceedings of the IEEE 4th Annual Workshop on Workload Characterization, Austin, TX, December, 2001.
12. R. F. Boisvert, R. Pozo, K. Remington, R. Barrett, and J. J. Dongarra. The Matrix Market: A web resource for test matrix collections. In R. F. Boisvert, editor, Quality of Numerical Software, Assessment and Enhancement, pages 125-137, London, 1997. Chapman and Hall. math.nist.gov/MatrixMarket.
13. T. Davis. UF Sparse Matrix Collection. www.cise.ufl.edu/research/sparse/ matrices.
14. S. Browne, J. Dongarra, N. Gamer, K. London, and P. Mucci. A scalable cross-platform infrastructure for application performance tuning using hardware counters. In Supercomputing, November 2000.
15. R. Barrett, M. Berry, T. F. Chan, J. Demmel, J. 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, 2nd Edition. SIAM, Philadelphia, PA, 1994.
16. K. Remington and R. Pozo. NIST Sparse BLAS: User's Guide. Technical report, NIST, 1996. gams.nist.gov/spblas.
17. W. D. Gropp, D. K. Kaushik, D. E. Keyes,and B. F. Smith. High performance parallel implicit CFD. Parallel Computing, 27(4), March 2001.
18. O. Temam and W. Jalby. Characterizing the behavior of sparse algorithms on caches. In Proceedings of Supercomputing 92, 1992.
19. B.B. Fraguela, R. Doallo, and E.L. Zapata. Memory hierarchy performance prediction for sparse blocked algorithms. Parallel Processing Letters, 9(3), March, 1999.
20. A.J.C. Bik and H.A.G. Wijshoff. Automatic nonzero structure analysis. SIAM Journal on Computing, 28(5):1576-1587, 1999.
21. W. Pugh and T. Spheisman. Generation of efficient code for sparse matrix computations. In Proceedings of the 11th Workshop on Languages and Compilers for Parallel Computing, LNCS, August 1998.
22. P. Stodghill. A Relational Approach to the Automatic Generation of Sequential Sparse Matrix Codes. PhD thesis, Cornell University, August 1997.