Mixed mode matrix multiplication

Proceedings - IEEE International Conference on Cluster Computing, ICCC

Volumn 2002-January, Issue , 2002, Pages 195-203

  Wu, Meng Shiou ^a   Aluru, S ^b   Kendall, Ricky A ^a  

^a U S DEPARTMENT OF ENERGY   (United States)

^b Department of Computer Science ^*  (United States)

Author keywords

Clustering algorithms; Computational modeling; Computer science; Data communication; Distributed computing; High speed networks; Laboratories; Message passing; US Department of Energy; Yarn

Indexed keywords

ALGORITHMS; CACHE MEMORY; CLUSTER COMPUTING; COMPUTER ARCHITECTURE; COMPUTER SCIENCE; DISTRIBUTED COMPUTER SYSTEMS; HIGH SPEED NETWORKS; LABORATORIES; MATRIX ALGEBRA; MEMORY ARCHITECTURE; MESSAGE PASSING; YARN;

ALGORITHMIC APPROACH; COMPUTATIONAL MODEL; DATA-COMMUNICATION; DISTRIBUTED MEMORY ALGORITHMS; IMPROVE PERFORMANCE; MATRIX MULTIPLICATION; SUPERLINEAR SPEEDUPS; US DEPARTMENT OF ENERGY;

CLUSTERING ALGORITHMS;

EID: 51549099930     PISSN: 15525244     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTR.2002.1137747     Document Type: Conference Paper

References (16)

1. http://hpcf.nersc.gov/computers/SP.
2. R. D. Blumofe, M. Frigo, C. F. Joerg, C. E. Leiserson, and K. H. Randall. Dag-consistent distributed shared memory. In Proceedings of the Eighth ACM Symposium on Parallel Algorithms and Architectures(SPAA), pages 297-308, Pauda, Italy, June 1996.
3. S. W. Bova, C. P. Breshears, H. Gabb, B. Kuhn, B. Magro, R. Eigenmann, G. Gaertner, S. Salvini, and H. Scott. Parallel Programming with Message Passing and Directives. Computing in Science and Engineering, 3(5):22-37, 2001.
4. S. Chatterjee, V. V. Jain, A. R. Lebeck, S. Mundhra, and M. Thottethodi. Nonlinear array layouts for hierarchical memory systems. In Proceedings of 1999 ACM International Conference on Supercomputing, pages 444-453, Rhodes, Greece, June 1999.
5. S. Chatterjee, A. R. Lebeck, P. K. Patnala, and M. Thottethodi. Recursive array layouts and fast parallel matrix multiplication. In Proceedings of the 11th ACM Symposium on Parallel Algorithms and Architectures, pages 222-231, Saint-Malo, France, June 19 1999.
6. I. L. Crawford and K. R. Wadleigh. Software Optimization for High Performance: Creating Faster Applications. Prentice Hall PTR, 2000. ISBN:0130170089.
7. K. Dowd and C. Severance. High Performance Computing, 2nd Edition. O'Reilly & Associates, 1998. ISBN:156592312X.
8. J. D. Frens and D. S. Wise. Auto-blocking matrix-multiplication or tracking blas3 performance from source code. In Proceedings of the Sixth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 206-216, Las Vegas, NV, June 1997.
9. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache oblivious algorithms. In Proceedings of the 40th Annual Symposium on Foundation of Computer Science(FOCS'99), pages 285-298, 1999.
10. V. Kumar, A. Grama, A. Gupta, and G. Karypis. Introduction to Parallel Computing: Design and Analysis of Parallel Algorithms. Addison-Wesley Pub Co., 1994. ISBN:0805331700.
11. A. LaMarca and R. E. Ladner. The influence of caches on the performance of sorting. In Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, pages 370-379. SIAM press, 1997.
12. H.-J. Lee, J. P. Robertson, and J. Fortes. Generalized cannon's algorithm for parallel matrix multiplication. In Proceedings of the 11th ACM International Conference on Supercomputing, pages 44-51, Vienna, Austria, July 1997.
13. H. Sagan. Space-Filling Curves. Springer-Verlag, 1994. ISBN:0387942653.
14. V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13:354-356, 1969.
15. M. Thottethodi, S. Chatterjee, and A. R. Lebeck. Tuning strassen's matrix multiplication for memory efficiency. In Proceedings of SC98, High Performance Networking and Computing, Orlando, Florida, November 1998.
16. R. C. Whaley and J. J. Dongarra. Automatically tuned linear algebra software. Technical Report UT-CS-97-366, University of Tennessee, 1997.