Efficient Matrix Multiplication on SIMD Computers
Petter E. Bjørstad, Fredrik Manne, Tor Sørevik, Marián Vajteršic · SIAM Journal on Matrix Analysis and Applications · 1992
Efficient algorithms are described for matrix multiplication on SIMD computers. SIMD implementations of Winograd’s algorithm are considered in the case where additions are faster than multiplications. Classical kernels and the use of Strassen’s algorithm are also considered. Actual performance figures using the MasPar family of SIMD computers are presented and discussed.