TY - GEN
T1 - Cache oblivious matrix operations using peano curves
AU - Bader, Michael
AU - Mayer, Christian
PY - 2007
Y1 - 2007
N2 - Algorithms are called cache oblivious, if they are designed to benefit from any kind of cache hierarchy - regardless of its size or number of cache levels. In linear algebra computations, block recursive techniques are a common approach that, by construction, lead to inherently local data access patterns, and thus to an overall good cache performance [3]. We present block recursive algorithms that use an element ordering based on a Peano space filling curve to store the matrix elements. We present algorithms for matrix multiplication and LU decomposition, which are able to minimize the number of cache misses on any cache level.
AB - Algorithms are called cache oblivious, if they are designed to benefit from any kind of cache hierarchy - regardless of its size or number of cache levels. In linear algebra computations, block recursive techniques are a common approach that, by construction, lead to inherently local data access patterns, and thus to an overall good cache performance [3]. We present block recursive algorithms that use an element ordering based on a Peano space filling curve to store the matrix elements. We present algorithms for matrix multiplication and LU decomposition, which are able to minimize the number of cache misses on any cache level.
UR - http://www.scopus.com/inward/record.url?scp=38049077599&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-75755-9_64
DO - 10.1007/978-3-540-75755-9_64
M3 - Conference contribution
AN - SCOPUS:38049077599
SN - 9783540757542
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 521
EP - 530
BT - Applied Parallel Computing
PB - Springer Verlag
T2 - 8th International Workshop on Applied Parallel Computing, PARA 2006
Y2 - 18 June 2007 through 21 June 2007
ER -