OSKI: A library of automatically tuned sparse matrix kernels

Journal of Physics: Conference Series

Volumn 16, Issue 1, 2005, Pages 521-530

  Vuduc, Richard ^a   Demmel, James W ^b   Yelick, Katherine A ^b  

^a LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 24344485098     PISSN: 17426588     EISSN: 17426596     Source Type: Conference Proceeding    
DOI: 10.1088/1742-6596/16/1/071     Document Type: Conference Paper

References (45)

1. Vuduc R 2003 Automatic performance tuning of sparse matrix kernels PhD Thesis (University of California, Berkeley, Berkeley, CA, USA)
2. Bilmes J, K Asanovic, C W Chin and J Demmel 1997 Optimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology Proc. Int. Conf. on Supercomputing, Vienna, Austria, July 1997, ACM SIGARC
3. Whaley R C, A Petitet and J Dongarra 2001 Automated empirical optimizations of software and the ATLAS project Parallel Computing 27 (1) 3-25
4. Im E-J, K Yelick and R Vuduc 2004 Sparsity: Optimization framework for sparse matrix kernels Int. J. High Perform. Comput. Appl. 18 (1) 135-58
5. Vuduc R, J W Demmel, K A Yelick, S Kamil, R Nishtala and B Lee 2002 Performance optimizations and bounds for sparse matrix-vector multiply Proc. Supercomputing, Baltimore, MD, USA, November 2002
6. Lee B C, R Vuduc, J W Demmel, K A Yelick, M deLorimier and L Zhong 2003 Performance optimizations and bounds for sparse symmetric matrix-multiple vector multiply Technical Report UCB/CSD-03-1297 (University of California, Berkeley, Berkeley, CA, USA)
7. Nishtala R, R Vuduc, J Demmel and K Yelick 2004 When cache blocking sparse matrix vector multiply works and why Proc. PARA'04 Workshop on the State-of-the-art in Scientific Computing, Copenhagen, Denmark, June 2004
8. Vuduc R, A Gyulassy, J W Demmel and K A Yelick 2003 Memory hierarchy optimizations and bounds for sparse ATAx Proc. ICCS Workshop on Parallel Linear Algebra, volume LNCS, Melbourne, Australia, June 2003 (Springer)
9. Vuduc R, S Kamil, J Hsu, R Nishtala, J W Demmel and K A Yelick June 2002 Automatic performance tuning and analysis of sparse triangular solve ICS 2002 Workshop on Performance Optimization via High-Level Languages and Libraries, New York, USA, June 2002
10. Hsu C 2003 Effects of block size on the block Lanczos algorithm Senior Thesis
11. Berkeley Benchmarking and OPtimization (BeBOP) Project 2004 http://bebop.cs.berkeley.edu
12. Blackford S L, J W Demmel, J Dongarra, I S Du, S Hammarling, G Henry, M Heroux, L Kaufman, A Lumsdaine, A Petitet, R Pozo, K Remington and R C Whaley 2002 An updated set of basic linear algebra subprograms (BLAS) ACM Trans. Math. Softw. 28 (2) 135-51
13. Du I S, M A Heroux and R Pozo 2002 An overview of the sparse basic linear algebra subprograms The new standard from the BLAS technical forum ACM Trans. Math. Softw. 28 (2) 239-67
14. Duff I S and C Vömel J 2002 Algorithm 818 A reference model implementation of the sparse BLAS in Fortran 95 ACM Trans. Math. Softw. 28 (2) 268-83
15. Saad Yousef 1994 SPARSKIT A basic toolkit for sparse matrix computations http://www.cs.umn.edu/Research/arpa/SPARSKIT/sparskit.html
16. Filippone S and M Colajanni 2000 PSBLAS A library for parallel linear algebra computation on sparse matrices ACM Trans. Math. Software 26 (4) 527-50
17. Vuduc R, J Demmel and K Yelick 2005 OSKI An interface for a self-optimizing library of sparse matrix kernels http://bebop.cs.berkeley.edu/ oski
18. Balay S, W D Gropp, L C McInnes and B F Smith 1997 Efficient management of parallelism in object oriented numerical software libraries Modern Software Tools in Scientific Computing ed E Arge, A M Bruaset, and H P Langtangen (Birkhauser Press) pp 163-202
19. Balay S, K Buschelman, W D Gropp, D Kaushik, M Knepley, L C McInnes, B F Smith and H Zhang 2002 PETSc User's Manual. Technical Report ANL-95/11 - Revision 2.1.5 Argonne National Laboratory http://www.mcs.anl.gov/petsc
20. The MathWorks Inc. 2003 Matlab http://www.mathworks.com
21. Gilbert J R, C Moler and R Schreiber 1992 Sparse matrices in MATLAB Design and implementation SIAM J. Matrix Anal. Appl. 13 (1) 333-56
22. Remington K and R Pozo 1996 NIST Sparse BLAS User's Guide Technical report, NIST http://gams.nist.gov/spblas
23. Lee B C, R Vuduc, J Demmel and K Yelick 2004 Performance models for evaluation and automatic tuning of symmetric sparse matrix-vector multiply Proc. Int. Conf. on Parallel Processing, Montreal, Canada, August 2004
24. Ierusalimschy R, L H de Figeiredo and W Celes 2003 Lua 5.0 Reference Manual Technical Report MCC-14/03, PUC-Rio http://www.lua.org
25. Frigo M and S Johnson 1998 FFTW An adaptive software architecture for the FFT Proc. Int. Conf. on Acoustics, Speech, and Signal Processing, Seattle, Washington, May 1998
26. Vuduc R and Hyun-Jin Moon 2005 Fast sparse matrix-vector multiplication by exploiting variable block structure Technical Report UCRL-TR-213454 Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, CA, USA
27. Musser D R and A A Stepanov 1994 Algorithm-oriented generic libraries Software Practice Experience 24 623-42
28. Veldhuizen T 1998 Arrays in Blitz++ Proc. ISCOPE, Lecture Notes Comput. Sci. 1505 (Springer-Verlag)
29. Siek J G and A Lumsdaine 1998 A rational approach to portable high performance the Basic Linear Algebra Instruction Set (BLAIS) and the Fixed Algorithm Size Template (fast) library Proc. ECOOP, Brussels, Belgium
30. Bik A J C 1996 Compiler Support for Sparse Matrix Codes PhD Thesis Leiden University
31. Bik A J C, P J H Birkhaus, P M W Knijnenburg and H A G Wijsho July 1998 The automatic generation of sparse primitives ACM Trans. Math. Softw. 24 (2) 190-225
32. Bik A J C and H A G Wijsho 1999 Automatic nonzero structure analysis SIAM J. Comput 28 (5) 1576-87
33. Stodghill P 1997 A Relational Approach to the Automatic Generation of Sequential Sparse Matrix Codes PhD Thesis Cornell University
34. Ahmed N, N Mateev, K Pingali and P Stodghill 2000 A framework for sparse matrix code synthesis from high-level specifications Proc. Supercomputing 2000, Dallas, TX, November 2000
35. Mateev N, K Pingali, P Stodghill and V Kotlyar 2000 Next-generation generic programming and its application to sparse matrix computations Int. Conf. on Supercomputing
36. Mateev N, K Pingali and P Stodghill 2000 The Bernoulli Generic Matrix Library Technical Report TR-2000-1808 Cornell University
37. Pugh W and T Shpeisman 1998 Generation of Efficient code for sparse matrix computations Proc. 11th Workshop on Languages and Compilers for Parallel Computing, August 1998, Lecture Notes Comput. Sci. (Springer)
38. Irwin J, J-M Loingtier, J Gilbert, G Kiczales, J Lamping, A Mendhekar and T Shpeisman 1997 Aspect-oriented programming of sparse matrix code Proc. Int. Scientific Computing in Object-Oriented Parallel Environments, Marina del Rey, CA, USA, December 1997
39. George A and J W H Liu 1979 The design of a user interface for a sparse matrix package ACM Trans. Math. Software 5 (2) 139-62
40. Heimsund B-O 2003 JMP: A sparse matrix library in Java http://www.mi.uib.no/∼bjornoh/jmp
41. Eaton J W 2003 Octave http://www.octave.org
42. Almási G and D Padua 2002 MaJIC Compiling MATLAB for speed and responsiveness Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, Berlin, Germany, June 2002
43. Menon V and K Pingali 1999 A case for source-level transformations in MATLAB Proc. 2nd Conf. on Domain-Specific Languages, Austin, TX, October 1999
44. Demmel J, J Dongarra, V Eijkhout, E Fuentes, A Petitet, R Vuduc, R C Whaley and K Yelick 2005 Self adapting linear algebra algorithms and software Proc. IEEE Special Issue Program Generation, Optimization, Adaptation, February 2005
45. Shah V and J R Gilbert 2004 Sparse matrices in Matlab *P:Design and implementation Proc. Int. Conf. on High-Performance Computing, Bangalore, India, Lecture Notes Comput. Sci. 3296 (Springer) 144-55