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, Chung-Chiang Chou, Yuan Wang

Publication date: 12 December 1995

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

zbMATH Keywords

matrix multiplicationdistributed-memory MIMD architecturesStrassen's method

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computer system organization (68M99)

Related Items (1)

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

This page was built for publication: Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures