Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
We propose several new schedules for Strassen-Winograd's matrix multiplication algorithm, they reduce the extra memory allocation requirements by three different means: by introducing a few pre-additions, by overwriting the input matrices, or by using a first recursive level of classical multiplication. In particular, we show two fully in-place schedules: one …