Cache oblivious matrix transposition: Simulation and experiment

Dimitrios Tsifakis, Alistair P. Rendell, Peter E. Strazdins

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)17-25
Number of pages9
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3037
DOIs
Publication statusPublished - 1 Dec 2004
Externally publishedYes

Fingerprint Dive into the research topics of 'Cache oblivious matrix transposition: Simulation and experiment'. Together they form a unique fingerprint.

  • Cite this