Adaptive Strassen's matrix multiplication

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2007, Pages 284-292

  D'Alberto, Paolo ^a   Nicolau, Alexandru ^b  

^a YAHOO INC   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Fast algorithms; Matrix multiplications

Indexed keywords

HIERARCHICAL SYSTEMS; NUMERICAL ANALYSIS; PARALLEL PROCESSING SYSTEMS;

ATLAS/GOTOBLAS; FAST ALGORITHMS; MATRIX MULTIPLICATIONS;

ADAPTIVE ALGORITHMS;

EID: 34548016784     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1274971.1275010     Document Type: Conference Paper

References (33)

1. D. Bailey, K. Lee, and H. Simon. Using strassen's algorithm to accelerate the solution of linear systems. J. Supercomput., 4(4):357-371, 1990.
2. D. H. Bailey and H. R. P. Gerguson. A Strassen-Newton algorithm for high-speed parallelizable matrix inversion. In Supercomputing '88: Proceedings of the 1988 ACM/IEEE conference on Supercomputing, pages 419-424. IEEE Computer Society Press, 1988.
3. G. Bilardi, P. D'Alberto, and A. Nicolau. Fractal matrix multiplication: a case study on portability of cache performance. In Workshop on Algorithm Engineering 2001, Aarhus, Denmark, 2001.
4. R. P. Brent. Algorithms for matrix multiplication. Technical Report TR-CS-70-157, Stanford University, Mar 1970.
5. R. P. Brent. Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity. Numerische Mathematik, 16:145-156, 1970.
6. S. Chatterjee, A.R. Lebeck, P.K. Patnala, and M. Thottethodi. Recursive array layout and fast parallel matrix multiplication. In Proc. 11-th ACM SIGPLAN, June 1999.
7. H. Cohn, R. Kleinberg, B. Szegedy, and C. Umans. Group-theoretic algorithms for matrix multiplication, Nov 2005.
8. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In Proceedings of the 19-th annual ACM conference on Theory of computing, pages 1-6, 1987.
9. P. D'Alberto and A. Nicolau. Adaptive Strassen and ATLAS's DGEMM: A fast square-matrix multiply for modern high-performance systems. In The 8th International Conference on High Performance Computing in Asia Pacific Region (HPC asia), pages 45-52, Beijing, Dec 2005.
10. P. D'Alberto and A. Nicolau. Using recursion to boost ATLAS's performance. In The Sixth International Symposium on High Performance Computing (ISHPC-VI), 2005.
11. J. Demmel, J. Dongarra, E. Eijkhout, E. Fuentes, E. Petitet, V. Vuduc, R.C. Whaley, and K. Yelick. Self-Adapting linear algebra algorithms and software. Proceedings of the IEEE, special issue on "Program Generation, Optimization, and Adaptation", 93(2), 2005.
12. J. Demmel, J. Dumitriu, O. Holtz, and R. Kleinberg. Fast matrix multiplication is stable, Mar 2006.
13. J. Demmel and N. Higham. Stability of block algorithms with fast level-3 BLAS. ACM Transactions on Mathematical Software, 18(3):274-291, 1992.
14. N. Eiron, M. Rodeh, and I. Steinwarts. Matrix multiplication: a case study of algorithm engineering. In Proceedings WAE'98, Saarbru̇cken, Germany, Aug 1998.
15. J.D. Frens and D.S. Wise. Auto-Blocking matrix-multiplication or tracking BLAS3 performance from. source code. Proc. 1997 ACM Symp. on Principles and Practice of Parallel Programming, 32(7):206-216, July 1997.
16. M. Frigo and S. Johnson. The design and implementation of FFTW3. Proceedings of the IEEE, special issue on "Program Generation, Optimization, and Adaptation", 93(2):216-231, 2005.
17. M. Frigo, C.E. Leiserson, H. Prokop, and S. Ramachandran. Cache oblivious algorithms. In Proceedings 40th Annual Symposium on Foundations of Computer Science, 1999.
18. K. Goto and R.A. van de Geijn. Anatomy of high-performance matrix multiplication. ACM Transactions on Mathematical. Software.
19. J.A. Gunnels, F.G. Gustavson, G.M. Henry, and R.A. van de Geijn. FLAME: Formal Linear Algebra Methods Environment. ACM Transactions on Mathematical Software, 27(4):422-455, December 2001.
20. N.J. Higham. Exploiting fast matrix multiplication within the level 3 BLAS. ACM Trans. Math. Softw., 16(4):352-368, 1990.
21. N.J. Higham. Accuracy and Stability of Numerical Algorithms, Second Edition. SIAM, 2002.
22. S. Huss-Lederman, E.M. Jacobson, A. Tsao, T. Turnbull, and J.R. Johnson. Implementation of Strassen's algorithm for matrix multiplication. In Supercomputing '96: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM), page 32. ACM Press, 1996.
23. I. Kaporin. A practical algorithm for faster matrix multiplication. Numerical Linear Algebra with Applications, 6(8):687-700, 1999. Centre for Supercomputer and Massively Parallel Applications, Computing Centre of the Russian Academy of Sciences, Vavilova 40, Moscow 117967, Russia.
24. Igor Kaporin. The aggregation and cancellation techniques as a practical tool, for faster matrix multiplication. Theor. Comput. Sci., 315(2-3):469-510, 2004.
25. P. Knight. Fast rectangular matrix multiplication and QR-decomposition. Linear algebra and its applications, 221:69-81, 1995.
26. X. Li, M. Garzaran, and D. Padua. Optimizing sorting with genetic algorithms. In In In Proc. of the Int. Symp. on Code Generation and Optimization, pages 99-110, March 2005.
27. V. Pan. Strassen's algorithm, is not optimal: Trililnear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations. In FOCS, pages 166-176, 1978.
28. V. Pan. How can we speed up matrix multiplication? SIAM Review, 26(3):393-415, 1984.
29. D. Priest. Algorithms for arbitrary precision floating point arithmetic. In P. Kornerup and D. W. Matula, editors, Proceedings of the 10th IEEE Symposium on Computer Arithmetic (Arith-10), pages 132-144, Grenoble, France, 1991. IEEE Computer Society Press, Los Alamitos, CA.
30. M. Püschel, J.M.F. Moura, J. Johnson, D. Padua, M. Veloso, B.W. Singer, J. Xiong, F. Franchetti, A. Gačić, Y. Voronenko, K. Chen, R.W. Johnson, and N. Rizzolo. SPIRAL: Code generation for DSP transforms. Proceedings of the IEEE, special issue on "Program Generation, Optimization, and Adaptation", 93(2), 2005.
31. V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 14(3):354-356, 1969.
32. M. Thottethodi, S. Chatterjee, and A.R. Lebeck. Tuning Strassen's matrix multiplication for memory efficiency. In Proc. Supercomputing, Orlando, FL, nov 1998.
33. R. Whaley and J. Dongarra. Automatically tuned linear algebra software. In Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM), pages 1-27. IEEE Computer Society, 1998.