Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures

DOI10.1016/0898-1221(95)00077-CzbMath0839.68093MaRDI QIDQ1903780

Yuefan Deng, Gang Li, Yuan Wang, Chung-Chiang Chou

Publication date: 12 December 1995

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

matrix multiplication; distributed-memory MIMD architectures; Strassen's method

Mathematics Subject Classification ID

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68M99: Computer system organization

Related Items

Using Strassen's matrix multiplication in high performance solution of linear systems

Uses Software

• PUMMA
• CLASSPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel matrix transpose algorithms on distributed memory concurrent computers
• Matrix algorithms on a hypercube. I: Matrix multiplication
• Gaussian elimination is not optimal
• Parallel Algorithms for Dense Linear Algebra Computations
• How Can We Speed Up Matrix Multiplication?
• Extra High Speed Matrix Multiplication on the Cray-2
• Efficient Matrix Multiplication on SIMD Computers
• Exploiting fast matrix multiplication within the level 3 BLAS
• Reducing the Symmetric Matrix Eigenvalue Problem to Matrix Multiplications