Mixed parallel implementations of the top level step of Strassen and Winograd matrix multiplication algorithms

Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001

Volumn , Issue , 2001, Pages

  Desprez, F ^a   Suter, F ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

matrix multiplication; Mixed parallelism; Strassen; Winograd

Indexed keywords

ALGORITHMS;

COMMUNICATION COST; MATRIX MULTIPLICATION; MATRIX MULTIPLICATION ALGORITHM; MIXED PARALLELISMS; PARALLEL IMPLEMENTATIONS; STRASSEN; THEORETICAL EVALUATION; WINOGRAD;

MATRIX ALGEBRA;

EID: 3042755751     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2001.924938     Document Type: Conference Paper

References (18)

1. D. Bailey, K. Lee, and H. Simon. Using Strassen's Algorithm to Accelerate the Solution of Linear Systems. Journal of Supercomputing, 4(4):357-371, Jan 1991.
2. H. Bal and M. Haines. Approaches for Integrating Task and Data Parallelism. IEEE Concurrency, Jul-Sep 1998.
3. L. Blackford, J. Choi, A. Cleary, E. D'Azevedo, J. Demmel, I. Dhillon, J. Dongarra, S. Hammarling, G. Henry, A. Petitet, K. Stanley, D. Walker, and R. Whaley. ScaLA-PACK Users' Guide. SIAM, 1997.
4. E. Caron, D. Lazure, and G. Utard. Performance Prediction and Analysis of Parallel Out-of-Core Matrix Factorization. In Proceedings of the 7th International Conference on High Performance Computing, Dec 2000.
5. S. Chatterjee, A. Lebeck, P. Patnala, and M. Thottethodi. Recursive Array Layouts and Fast Parallel Matrix Multiplication. In Proceedings of 11th Annual ACM Symposium on Parallel Algorithms and Architectures, June 1999.
6. C. Chou, Y. Deng, and Y. Wang. A Massively Parallel Method for Matrix Multiplication Based on Strassen's Method. Technical Report SUNYSB-AMS-93-17, Center for Scientific Computing, Univ. of Stony Brook, Nov 1993.
7. B. Dumitrescu, J. Roch, and D. Trystram. Fast Matrix Multiplication Algorithms on MIMD Architectures. Technical Report RT-87, LMC-IMAG, INPG Grenoble, France, July 1992.
8. P. Fischer and R. Probert. Efficient Procedures for Using Matrix Algorithms. In Automata, Languages and Programming, volume 14 of Lecture Notes in Computer Science, pages 413-427. Springer-Verlag, Berlin, 1974.
9. B. Grayson and R. V. de Geijn. A High Performance Parallel Strassen Implementation. Parallel Processing Letters, 6(1):3-12, 1996.
10. N. Higham. Exploiting Fast Matrix Multiplication Within the Level 3 BLAS. Technical Report TR89-984, Dept of CS - Center of Applied Mathematics - Cornell University, Apr 1989.
11. S. Huss-Lederman, E. Jacobson, J. Johnson, A. Tsao, and T. Turnbull. Strassen's Algorithm for Matrix Multiplication: Modeling, Analysis, and Implementation. Technical Report CCS-TR-96-147, Center for Computing Sciences, Argonne National Lab., 1996.
12. B. Kågström, P. Ling, and C. V. Loan. GEMM-Based Level 3 BLAS: High Performance Model Implementations and Performance Evaluation Benchmark. Technical Report UMINF-95.18, Umeå University, Oct 1995.
13. L. Prylli and B. Tourancheau. Fast Runtime Block Cyclic Data Redistribution on Multiprocessors. Journal of Parallel and Distributed Computing, 45, Aug 1997.
14. S. Ramaswany. Simultaneous Exploitation of Task and Data Parallelism in Regular Scientific Applications. PhD thesis, Univ. of Illinois, Urbana-Champaign, 1996.
15. T. Rauber and G. Rünger. Scheduling of Data Parallel Modules for Scientific Computing. In Proceedings of 9th SIAM Conference on Parallel Processing for Scientific Computing, San Antonio, Mar 1999.
16. W. Rönsch and H. Strauß. The Level 3 BLAS Forms of Parallel Factorization Methods. In D. Evans, G. Joubert, and F. Peters, editors, Parallel Computing 89, pages 85-92. Elsevier Science Publisher B.V., 1989.
17. V. Strassen. Gaussian Elimination Is Not Optimal. Numerische Mathematik, 14(3):354-356, 1969.
18. M. Thottethodi, S. Chatterjee, and A. Lebeck. Tuning Strassen's Matrix Multiplication for Memory Efficiency. In Proceedings of Supercomputing'98, Orlando, Nov 1998.