The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January/February (2008 vol.28)
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
Moinuddin K. Qureshi, Aamer Jaleel, Yale N. Patt, Simon C. Steely Jr., Joel Emer, "Set-Dueling-Controlled Adaptive Insertion for High-Performance Caching", IEEE Micro, vol.28, no. 1, pp. 91-98, January/February 2008, doi:10.1109/MM.2008.14
REFERENCES
1. J.E. Smith and J.R. Goodman, "A Study of Instruction Cache Organizations and Replacement Policies," Proc. Int'l Symp. Computer Architecture (ISCA 10), ACM Press, 1983, pp. 132-137.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool