A family of high-performance matrix multiplication algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3732 LNCS, Issue , 2006, Pages 256-265

  Gunnels, John A ^a   Gustavson, Fred G ^a   Henry, Greg M ^b   Van De Geijn, Robert A ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b INTEL CORPORATION   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HIERARCHICAL MEMORY; MATRIX MULTIPLICATION; MEMORY LEVELS; OPERAND MATRICES;

ALGORITHMS; BUFFER STORAGE; MATHEMATICAL MODELS; MATRIX ALGEBRA; STORAGE ALLOCATION (COMPUTER);

COMPUTATIONAL METHODS;

EID: 33745303272     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11558958_30     Document Type: Conference Paper

References (13)

1. 2001. J A Gunnels, G M Henry, and R A van de Geijn: A Family of High-Performance Matrix Multiplication Algorithms, LNCS 2073, pp. 51-60. V N Alexandrov, J J Dongarra, B A Juliano, R S Renner, C J K Tan, Ed., Springer-Verlag, Pub.
2. 1986. ESSL Guide and Reference for IBM ES/3090 Vector Multiprocessors, Order No. SA22-7220, Feb. 1986., IBM Corporation.
3. 1987. Kyle Gallivan, William Jalby, Ulrike Meier, and Ahmed Sameh, The Impact of Hierarchical Memory Systems on Linear Algebra Algorithm Design, CSRD Tech Report 625, University of Illinois at Urbana Champaign, pub.
4. 1994. R. C. Agarwal, F. Gustavson, and M. Zubair, Exploiting functional parallelism on Powert to design high-performance numerical algorithms, IBM Journal of Research and Development, Volume 38, Number 5, pp. 563-576, 1994.
5. 1997. Jeff Bilmes, Krste Asanovic, Chee-whye Chin, and Jim Demmel, Optimizing Matrix Multiply using PHiPAC: a Portable, High-Performance, ANSI C Coding Methodology, Proc. of Int. Conf. on Supercomputing, Vienna, Austrian. July 1997.
6. 1998. R. Clint Whaley and Jack J. Dongarra, Automatically Tuned Linear Algebra Software, In Proceedings of Supercomputing 1998.
7. 2002, K. Goto and R. vandeGeijn, On reducing TUB missen in matrix multiplication, University of Texas at Austin, FLAME Working Note #9, November, 2002.
8. 2001. Fred G. Gustavson, New Generalized Matrix Data Structures Lead to a Variety of High-Performance Algorithms, The Architecture of Scientific Software, Ronald F. Boisvert and Ping Tak Peter Tang, Ed., Kluwer Academic Press, Pub., 2001.
9. 2004. Erik Elmroth, Fred Gustavson, Isak Jonsson, Bo Kagstrom, Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software, SIAM Review, Volume 46 Number 1, pp. 3-45, 2004.
10. 1999. Matteo Frigo, Charles E. Leiserson, Harald Prokop, Sridhar Ramachandran, Cache-Oblivious Algorithms, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999.IEEE Computer Society, pub.
11. 1981. J. Hong and H. Kung, Complexity: The Red-Blue Pebble Game, In Proceedings of the 13th Annual ACM Symposium on Theory of Computing, pp. 326-333, 1981.
12. 1999. Sivan Toledo, A Survey of Out-of-Core Algorithms in Numerical Linear Algebra, in External Memory Algorithms and Visualization, J. Abello & J S Vitter, Ed., DIMACS Series in Disc. Math. & Theo. Comp. Sci., pp. 161-180, AMS Press, pub.
13. 2004. Kazushige Goto, http://www.cs.utexas.edu/users/kgoto