Fast algorithms and their implementation on specialised parallel computers
Fast algorithms and their implementation on specialised parallel computers
A parallel algorithm for the generalized Strassen method
Rivista di Informatica
The systematic design of systolic arrays
Centre National de Recherche Scientifique on Automata networks in computer science: theory and applications
Extra high speed matrix multiplication on the Cray-2
SIAM Journal on Scientific and Statistical Computing
Efficient matrix multiplication on SIMD computers
SIAM Journal on Matrix Analysis and Applications
Proceedings of the international workshop on Algorithms and parallel VLSI architectures II
Parallel Algorithms and Matrix Computation
Parallel Algorithms and Matrix Computation
VLSI and Modern Signal Processing
VLSI and Modern Signal Processing
A Family of New Efficient Arrays for Matrix Multiplication
IEEE Transactions on Computers
A High Performance Parallel Strassen Implementation
A High Performance Parallel Strassen Implementation
A fast cellular method of matrix multiplication
Cybernetics and Systems Analysis
A mixed cellular method of matrix multiplication
Cybernetics and Systems Analysis
A Divide-and-Conquer Strategy and PVM Computation Environment for the Matrix Multiplication
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Fast hybrid matrix multiplication algorithms
Cybernetics and Systems Analysis
| Hi-index | 0.00 |
A new fast matrix multiplication algorithm is proposed, which, as compared to the Winograd algorithm, has a lower multiplicative complexity equal to W_M \approx 0.437n^3 multiplication operations. Based on a goal-directed transformation of its basic graph, new optimized architectures of systolic arrays are synthesized. A systolic variant of the Strassen algorithm is presented for the first time.