Set-Dueling-Controlled Adaptive Insertion for High-Performance Caching

Set-Dueling-Controlled Adaptive Insertion for High-Performance Caching

The commonly used LRU replacement policy causes thrashing for memory- intensive workloads. A simple mechanism that dynamically changes the insertion policy used by LRU replacement reduces cache misses by 21 percent and requires a total storage overhead of less than 2 bytes.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE MICRO 2008-01, Vol.28 (1), p.91-98
Hauptverfasser: Qureshi, Moinuddin K., Jaleel, Aamer, Patt, Yale N., Steely, Simon C., Emer, Joel
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Bridges
Cache
Cache storage
Caching
Computer architecture
Data structures
Filters
Hardware
Insertion
Policies
Proposals
Random access memory
replacement
set dueling
set sampling
System performance
thrashing
Workload
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The commonly used LRU replacement policy causes thrashing for memory- intensive workloads. A simple mechanism that dynamically changes the insertion policy used by LRU replacement reduces cache misses by 21 percent and requires a total storage overhead of less than 2 bytes.
ISSN:0272-1732
1937-4143
DOI:10.1109/MM.2008.14