Adaptive line placement with the set balancing cache

Citations Over TimeTop 10% of 2009 papers

Abstract

Efficient memory hierarchy design is critical due to the increasing gap between the speed of the processors and the memory. One of the sources of inefficiency in current caches is the non-uniform distribution of the memory accesses on the cache sets. Its consequence is that while some cache sets may have working sets that are far from fitting in them, other sets may be underutilized because their working set has fewer lines than the set. In this paper we present a technique that aims to balance the pressure on the cache sets by detecting when it may be beneficial to associate sets, displacing lines from stressed sets to underutilized ones. This new technique, called Set Balancing Cache or SBC, achieved an average reduction of 13% in the miss rate of ten benchmarks from the SPEC CPU2006 suite, resulting in an average IPC improvement of 5%.

Related Papers

• → Cache-adaptive algorithms(2014)33 cited
• → Exact and fast L1 cache simulation for embedded systems(2009)26 cited
• → Memory hierarchy characterization of SPEC CPU2006 and SPEC CPU2017 on the Intel Xeon Skylake-SP(2019)23 cited
• → Cache-Adaptive Algorithms(2013)14 cited
• → A novel cache mapping scheme for dynamic set-based cache partitioning(2009)4 cited