Efficient matrix multiplication on SIMD computers

摘要: Efficient algorithms are described for matrix multiplication on SIMD computers. implementations of Winograd’s algorithm considered in the case where additions faster than multiplications. Classical kernels and use Strassen’s also considered. Actual performance figures using MasPar family computers presented discussed.