Reused-Based Replacement Policy for Last-Level Cache with Minimum Hardware Cost

[1]  Jaehyuk Huh,et al.  Cache bursts: A new approach for eliminating dead blocks and increasing cache efficiency , 2008, 2008 41st IEEE/ACM International Symposium on Microarchitecture.

[2]  Babak Falsafi,et al.  Using dead blocks as a virtual victim cache , 2010, 2010 19th International Conference on Parallel Architectures and Compilation Techniques (PACT).

[3]  Shirshendu Das,et al.  Latency Aware Block Replacement for L1 Caches in Chip Multiprocessor , 2017, 2017 IEEE Computer Society Annual Symposium on VLSI (ISVLSI).

[4]  Jean-Loup Baer,et al.  Modified LRU policies for improving second-level cache behavior , 2000, Proceedings Sixth International Symposium on High-Performance Computer Architecture. HPCA-6 (Cat. No.PR00550).

[5]  Víctor Viñals,et al.  Exploiting reuse locality on inclusive shared last-level caches , 2013, TACO.

[6]  Shirshendu Das,et al.  Random-LRU: A Replacement Policy for Chip Multiprocessors , 2013, VDAT.

[7]  Christian Bienia,et al.  Benchmarking modern multiprocessors , 2011 .

[8]  Aamer Jaleel,et al.  Adaptive insertion policies for high performance caching , 2007, ISCA '07.

[9]  Michael Liebelt,et al.  An effectiveness-based adaptive cache replacement policy , 2014, Microprocess. Microsystems.

[10]  Margaret Martonosi,et al.  Cache decay: exploiting generational behavior to reduce cache leakage power , 2001, ISCA 2001.

[11]  Laszlo A. Belady,et al.  A Study of Replacement Algorithms for Virtual-Storage Computer , 1966, IBM Syst. J..

[12]  Milo M. K. Martin,et al.  Multifacet's general execution-driven multiprocessor simulator (GEMS) toolset , 2005, CARN.

[13]  Dong Li,et al.  A Survey Of Architectural Approaches for Managing Embedded DRAM and Non-Volatile On-Chip Caches , 2015, IEEE Transactions on Parallel and Distributed Systems.