Cache oblivious storage and access heuristics for blocked matrix-matrix multiplication

Simple item page
dc.creatorBock, Nicolas
dc.creatorRubensson, Emanuel H.
dc.creatorSałek, Paweł
dc.creatorNiklasson, Anders M. N.
dc.creatorChallacombe, Matt
dc.date2008-08-07
dc.date2008-08-15
dc.date.accessioned2026-07-07T09:56:37Z
dc.date.available2026-07-07T09:56:37Z
dc.descriptionWe investigate effects of ordering in blocked matrix--matrix multiplication. We find that submatrices do not have to be stored contiguously in memory to achieve near optimal performance. Instead it is the choice of execution order of the submatrix multiplications that leads to a speedup of up to four times for small block sizes. This is in contrast to results for single matrix elements showing that contiguous memory allocation quickly becomes irrelevant as the blocksize increases.
dc.descriptionFixed typos
dc.identifierhttps://arxiv.org/abs/0808.1108
dc.identifierhttp://arxiv.org/abs/0808.1108
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/167038
dc.subjectData Structures and Algorithms
dc.titleCache oblivious storage and access heuristics for blocked matrix-matrix multiplication
dc.typetext

Files

Collections

arXiv