Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm

Simple item page
dc.creatorBoyer, Brice
dc.creatorDumas, Jean-Guillaume
dc.creatorPernet, Clément
dc.creatorZhou, Wei
dc.date2007-07-16
dc.date2009-05-18
dc.date.accessioned2026-07-07T13:15:18Z
dc.date.available2026-07-07T13:15:18Z
dc.descriptionWe 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 having the same number of operations, if the input matrices can be overwritten; the other one, slightly increasing the constant of the leading term of the complexity, if the input matrices are read-only. Many of these schedules have been found by an implementation of an exhaustive search algorithm based on a pebble game.
dc.identifierhttps://arxiv.org/abs/0707.2347
dc.identifierhttp://arxiv.org/abs/0707.2347
dc.identifier(International Symposium on Symbolic and Algebraic Computation 2009), Séoul : Corée, République de (2009)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/230431
dc.subjectMathematical Software
dc.titleMemory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
dc.typetext

Files

Collections

arXiv