KIT | KIT-Bibliothek | Impressum | Datenschutz

Implications of memory mappings on cache misses

Genius, Daniela; Eisenbiegler, Jörn

This paper proposes an optimization by an alternative
approach to memory mapping. Low set associativity allows
representing cache lines by corresponding memory areas.
With the help of the notion of temporal reuse in the innermost
loop, the behaviour of values in the cache is modelled.
Combining these values into cache lines so that spatial reuse is
considered demands an alternative memory mapping.
Memory mappings with a low expectation of conflicts
are achieved by the random placement of arrays in memory.
Significant increase of cache misses for a worst case placement is
shown by experiments, as well as cache miss reduction achieved by
improving reuse.

Open Access Logo

Volltext §
DOI: 10.5445/IR/31098
Cover der Publikation
Zugehörige Institution(en) am KIT Institut für Programmstrukturen und Datenorganisation (IPD)
Publikationstyp Forschungsbericht/Preprint
Publikationsjahr 1998
Sprache Englisch
Identifikator ISSN: 1432-7864
KITopen-ID: 31098
Verlag Universität Karlsruhe (TH)
Umfang 10 S.
Serie Interner Bericht. Universität Karlsruhe, Fakultät für Informatik ; 1998,16
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page