Decoupled Cache Segmentation: Mutable Policy with Automated Bypass Conference Paper uri icon

abstract

  • The least recently used (LRU) replacement policy performs poorly in the last-level cache (LLC) because temporal locality of memory accesses is filtered by first and second level caches. We propose a cache segmentation technique that adapts to cache access patterns by predicting the best number of not-yet-referenced and already-referenced blocks in the cache. The technique is independent from the LRU policy so it can work with less expensive replacement policies. It can automatically detect when to bypass blocks to the CPU with no extra overhead. It outperforms LRU replacement on average by 5.2% with not-recently-used (NRU) replacement and on average by 2.2% with random replacement in a 2MB LLC in a single-core processor with a memory intensive subset of SPEC CPU 2006 benchmarks. 2011 IEEE.

name of conference

  • 2011 International Conference on Parallel Architectures and Compilation Techniques

published proceedings

  • 2011 International Conference on Parallel Architectures and Compilation Techniques

author list (cited authors)

  • Khan, S., & Jimnez, D. A.

citation count

  • 0

complete list of authors

  • Khan, Samira||JimĂ©nez, Daniel A

editor list (cited editors)

  • Rauchwerger, L., & Sarkar, V.

publication date

  • January 2011