Abstract
A cache oblivious matrix transposition algorithm is implemented and analyzed using simulation and hardware performance counters. Contrary to its name, the cache oblivious matrix transposition algorithm is found to exhibit a complex cache behavior with a cache miss ratio that is strongly dependent on the associativity of the cache. In some circumstances the cache behavior is found to be worst than that of a naïve transposition algorithm. While the total size is an important factor in determining cache usage efficiency, the sub-block size, associativity, and cache line replacement policy are also shown to be very important.
| Original language | English |
|---|---|
| Pages (from-to) | 17-25 |
| Number of pages | 9 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 3037 |
| DOIs | |
| Publication status | Published - 1 Dec 2004 |
| Externally published | Yes |
Fingerprint Dive into the research topics of 'Cache oblivious matrix transposition: Simulation and experiment'. Together they form a unique fingerprint.
Cite this
Tsifakis, D., Rendell, A. P., & Strazdins, P. E. (2004). Cache oblivious matrix transposition: Simulation and experiment. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3037, 17-25. https://doi.org/10.1007/978-3-540-24687-9_3