Minimizing development and maintenance costs in supporting persistently optimized BLAS

Software - Practice and Experience

Volumn 35, Issue 2, 2005, Pages 101-121

  Whaley, R Clint ^a   Petitet, Antoine ^b  

^a Florida State University   (United States)

^b SUN MICROSYSTEMS   (United States)

Author keywords

ATLAS; BLAS; Kernel optimization; Linear algebra; Recursive optimization

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER OPERATING SYSTEMS; COMPUTER SOFTWARE; CONSTRAINT THEORY; COSTS; MATRIX ALGEBRA; OPTIMIZATION; PHOTOGRAPHY; PROBLEM SOLVING;

BASIC LINEAR ALGEBRA SUBPROGRAMS (BLAS); KERNEL OPTIMIZATION; PERFORMANCE-CRITICAL ROUTINES; RECURSIVE OPTIMIZATION;

LINEAR ALGEBRA;

EID: 13244279577     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/spe.626     Document Type: Article

References (32)

1. Hanson R, Krogh F, Lawson C. A proposal for standard linear algebra subprograms. ACM SIGNUM Newsletter 1973; 8(16).
2. Lawson C, Hanson R, Kincaid D, Krogh F. Basic linear algebra subprograms for Fortran usage. ACM Transactions on Mathematical Software 1979; 5(3):308-323.
3. Dongarra J, Du Croz J, Hammarling S, Hanson R. Algorithm 656: An extended set of basic linear algebra subprograms: Model implementation and test programs. ACM Transactions on Mathematical Software 1988; 14(1): 18-32.
4. Dongarra J, Du Croz J, Hammarling S, Hanson R. An extended set of FORTRAN basic linear algebra subprograms. ACM Transactions on Mathematical Software 1988; 14(1):1-17.
5. Dongarra J, Du Croz J, Duff I, Hammarling S. A set of Level 3 basic linear algebra subprograms. ACM Transactions on Mathematical Software 1990; 16(1):1-17.
6. Whaley RC, Dongarra J. Automatically tuned linear algebra software. Technical Report UT-CS-97-366, University of Tennessee, December 1997. Available at: http://www.netlib.org/lapack/lawns/lawn131.ps.
7. Whaley RC, Dongarra J. Automatically tuned linear algebra software. SuperComputing 1998: High Performance Networking and Computing, November 1998. CD-ROM Proceedings. Available at: http.//www.cs.utk.edu/~rwhaley/papers/atlas_sc98.ps.
8. Whaley RC, Dongarra J. Automatically tuned linear algebra software. Ninth SIAM Conference on Parallel Processing for Scientific Computing, March 1999. CD-ROM Proceedings.
9. Whaley RC, Petitet A, Dongarra JJ. Automated empirical optimization of software and the ATLAS project. Parallel Computing 2001; 27(1-2):3-35. Also available as University of Tennessee LAPACK Working Note #147, UT-CS-00-448, 2000 (http://www.netlib.org/lapack/lawns/lawn147.ps).
10. Whaley RC, Petitet A, Dongarra JJ. Automated empirical optimization of software and the ATLAS project. Parallel Computing 2001; 27(1-2):3-35. Also available as University of Tennessee LAPACK Working Note #147, UT-CS-00-448, 2000 (http://www.netlib.org/lapack/lawns/lawn147.ps).
11. Whaley RC, Petitet A. ATLAS homepage. http://math-atlas.sourceforge.net [September 2003].
12. Bilmes J, Asanovic K, Chin C, Demmel J. Optimizing matrix multiply using PHiPAC: A portable, high-performance, ANSI C coding methodology. Proceedings of the ACM SIGARC International Conference on SuperComputing, Vienna, Austria, July 1997.
13. Frigo M, Johnson SG. The fastest Fourier transform in the West. Technical Report MIT-LCS-TR-728, Massachusetts Institute of Technology, 1997.
14. Frigo M, Johnson S. FFTW: An adaptive software architecture for the FFT. Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP), vol. 3, May 1998; 1381-1384.
15. Anderson E et al. LAPACK Users' Guide (3rd edn). SIAM: Philadelphia, PA, 1999.
16. Moura J, Johnson J, Johnson R, Padua D, Puschel M, Veloso M. Spiral: Automatic implementation of signal processing algorithms. Proceedings of the Conference on High-Performance Embedded Computing. MIT Lincoln Laboratories: Boston, MA, 2000.
17. Gustavson F. New generalized data structures for matrices lead to a variety of high performance algorithms. The Architectures for Scientific Software (IFIP Conference Proceedings, vol. 188), Boisvert R and Tang P (eds.), August 2001; 211-234.
18. Bacon DF, Graham SL, Sharp OJ. Compiler transformations for high-performance computing. ACM Computing Survey 1994;26(4):345-420.
19. Elmroth E, Gustavson F, Jonsson I, Kagstrom B. Recursive blocked algorithms and hybrid data structures for dense matrix library software. SIAM Review 2004; 46(1):3-45.
20. Hennessy J, Patterson D. Computer Architecture, A Quantitative Approach. Morgan Kaufmann: San Francisco, CA, 1990.
21. Kågström B, Ling P, van Loan C. GEMM-based Level 3 BLAS: High-performance model implementations and performance evaluation benchmark. Technical Report UMINF 95-18, Department of Computing Science, Umeå University, 1995.
22. Kågström B, Ling P, van Loan C. GEMM-based Level 3 BLAS: High performance model implementations and performance evaluation benchmark. ACM Transactions on Mathematical Software 1998; 24(3):268-302.
23. Kågström B, Ling P, van Loan C. GEMM-based Level 3 BLAS: High performance model implementations and performance evaluation benchmark. ACM Transactions on Mathematical Software 1998; 24(3):268-302.
24. Dayde M, Duff I, Petitet A. A parallel block implementation of Level 3 BLAS for MIMD vector processors. ACM Transactions on Mathematical Software 1994; 20(2): 178-193.
25. Gustavson F, Henriksson A, Jonsson I, Kågström B, Ling P. Recursive blocked data formats and BLAS for dense linear algebra algorithms. Applied Parallel Computing, PARA'98 (Lecture Notes in Computer Science, vol. 1541), Kågström B, Dongarra J, Elmroth E and Waśniewski J (eds.), June 1998; 195-206.
26. Gustavson F, Henriksson A, Jonsson I, Kågström B, Ling P. Superscalar GEMM-based Level 3 BLAS - the on-going evolution of a portable and high-performance library. Applied Parallel Computing, PARA'98 (Lecture Notes in Computer Science, vol. 1541), Kågström B, Dongarra J, Elmroth E and Waśniewski J (eds.), June 1998; 207-215.
27. Toledo S. Locality of reference in lu decomposition with partial pivoting. SIAM Journal on Matrix Analysis and Applications 1997; 18(4): 1065-1081.
28. Gustavson F. Recursion leads to automatic variable blocking for dense linear-algebra algorithms. IBM Journal of Research and Development 1997; 41(6):737-755.
29. Andersen BS, Gustavson FG, Wasniewski J. A recursive formulation of cholesky factorization of a matrix in packed storage. Technical Report UT CS-00-448, LAPACK Working Note No. 146, University of Tennessee, 2000.
30. Elmroth E, Gustavson F. Applying recursion to serial and parallel qr factorization leads to better performance. IBM Journal of Research and Development 2000; 44(4):605-624.
31. Inversion problem with TRSM. http://www.cs.utk.edu/~rwhaley/ATLAS/trsm_prob.html [September 2003].
32. Whaley RC. User contribution to ATLAS, http://math-atlas.sourceforge.net/devel/atlas_contrib/ [September 2003].