A scalable parallel Strassen's matrix multiplication algorithm for distributed-memory computers
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
Evolutionary Search for Matrix Multiplication Algorithms
Proceedings of the Fourteenth International Florida Artificial Intelligence Research Society Conference
A High Performance Parallel Strassen Implementation
A High Performance Parallel Strassen Implementation
On resource placements in 3D tori
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
Combining building blocks for parallel multi-level matrix multiplication
Parallel Computing
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Automatic reproduction of a genius algorithm: Strassen's algorithm revisited by genetic search
IEEE Transactions on Evolutionary Computation
A Strassen-like matrix multiplication suited for squaring and higher power computation
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
| Hi-index | 0.00 |
A new parallel implementation of Strassen's matrix multiplication algorithm is proposed for massively parallel supercomputers with 2D, all-port torus interconnection networks. The proposed algorithm employs a special conflict-free routing pattern for better scalability and is able to yield a performance rate very close to the theoretical bound for many practical network and matrix sizes. It effectively scales up to very large networks typically containing hundreds-of-thousands processors where petaflop or exaflop processing rates are sought.