The Community for Technology Leaders
Green Image
Issue No. 01 - January/February (2008 vol. 28)
ISSN: 0272-1732
pp: 91-98
Moinuddin K. Qureshi , IBM Research
Aamer Jaleel , Intel
Yale N. Patt , The University of Texas at Austin
Joel Emer , Intel
ABSTRACT
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.
INDEX TERMS
cache, replacement, thrashing, insertion, set sampling, set dueling
CITATION

M. K. Qureshi, A. Jaleel, S. C. Steely Jr., J. Emer and Y. N. Patt, "Set-Dueling-Controlled Adaptive Insertion for High-Performance Caching," in IEEE Micro, vol. 28, no. , pp. 91-98, 2008.
doi:10.1109/MM.2008.14
85 ms
(Ver 3.3 (11022016))