Set-dueling-controlled adaptive insertion for high-performance caching

IEEE Micro

Volumn 28, Issue 1, 2008, Pages 91-98

  Qureshi, Moinuddin K ^a   Jaleel, Aamer ^b   Patt, Yale N ^c   Steely Jr , Simon C ^a   Emer, Joel ^a  

^a IBM RESEARCH   (United States)

^b INTEL CORPORATION   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Cache; Insertion; Replacement; Set dueling; Set sampling; Thrashing

Indexed keywords

PUBLIC POLICY; SET THEORY; STORAGE ALLOCATION (COMPUTER);

INSERTION POLICY; SET DUELING; SET SAMPLING;

CACHE MEMORY;

EID: 41349120769     PISSN: 02721732     EISSN: None     Source Type: Journal    
DOI: 10.1109/MM.2008.14     Document Type: Article

References (3)

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.
2. L.A. Belady, "A Study of Replacement Algorithms for a Virtual-Storage Computer," IBM Systems J., vol. 5, no. 2, 1966, pp. 78-101.
3. M.K. Qureshi et al., "Adaptive Insertion Policies for High-Performance Caching," Proc. Int'l Symp. Computer Architecture (ISCA 34), ACM Press, 2007, pp. 167-178.