SIAM Journal on Scientific and Statistical Computing · 1988 · 73 citations · 5 references
ComputingComputer ScienceHigh-performance ComputingComputer ArchitectureParallel AlgorithmsParallel ComputingMatrix ComputationMemory Hierarchy OptimizationNumerical Linear AlgebraParallel ArchitecturesParallel Computer ArchitectureParallel Computing SystemsFloating-point ArithmeticMatrix MultiplicationMemory Bank ConflictsMemory ContentionMemory Contention ManagementNumerical Stability AnalysisParallel Matrix MultiplicationStrassen's Matrix Multiplication
The Cray-2 is capable of performing matrix multiplication at very high rates. Using library routines provided by Cray Research, Inc., performance rates of 300 to 425 MFLOPS can be obtained on a single processor, depending on system load. Considerably higher rates can be achieved with all four processors running simultaneously. This article describes how matrix multiplication can be performed even faster, at up to twice the above-listed rates. This can be achieved by: (1) employing Strassen’s matrix multiplication algorithm to reduce the number of floating-point operations performed and (2) utilizing local memory on the Cray-2 to avoid performance losses due to memory bank contention. The numerical stability and potential for parallel application of this procedure are also discussed.
5
Gaussian elimination is not optimal
Volker Strassen · Numerische Mathematik · 1969 · 2.5K citations
On the Asymptotic Complexity of Matrix Multiplication
Don Coppersmith, S. Winograd · SIAM Journal on Computing · 1982 · 209 citations
New Fast Algorithms for Matrix Operations
Victor Y. Pan · SIAM Journal on Computing · 1980 · 79 citations
Computational Complexity and Numerical Stability
Webb Miller · SIAM Journal on Computing · 1975 · 57 citations
Computational complexity of sequential and parallel algorithms
J. Nievergelt · Computer Compacts · 1986 · 21 citations