A Data Management Policy for Energy-Efficient Cache Mechanisms

This article introduces a cache management policy named FLEXII. It can reduce the number of dead-on-fill blocks, which are not reused until they are evicted from cache memories. Since these blocks do not contribute to performance improvement, they limit the energy saving achieved by dynamic cache resizing mechanisms, which will play key roles to improve the energy efficiency of future microprocessors. The evaluation results show that, by eliminating dead-on-fill blocks, FLEXII helps dynamic cache resizing mechanisms further reduce their energy consumption.

[1]  Yan Solihin,et al.  Predicting inter-thread cache contention on a chip multi-processor architecture , 2005, 11th International Symposium on High-Performance Computer Architecture.

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

[3]  Varghese George,et al.  Power management of the third generation intel core micro architecture formerly codenamed ivy bridge , 2012, 2012 IEEE Hot Chips 24 Symposium (HCS).

[4]  Norman P. Jouppi,et al.  CACTI 6.0: A Tool to Model Large Caches , 2009 .

[5]  Hiroaki Kobayashi,et al.  A flexible insertion policy for dynamic cache resizing mechanisms , 2013, 2013 IEEE COOL Chips XVI.

[6]  Mainak Chaudhuri,et al.  Pseudo-LIFO: The foundation of a new family of replacement policies for last-level caches , 2009, 2009 42nd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO).

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

[8]  Björn Franke,et al.  Cooperative partitioning: Energy-efficient cache partitioning for high-performance CMPs , 2012, IEEE International Symposium on High-Performance Comp Architecture.

[9]  John L. Henning.  SPEC CPU2006 benchmark descriptions , 2006, CARN.

[10]  Kaushik Roy,et al.  Gated-Vdd: a circuit technique to reduce leakage in deep-submicron cache memories , 2000, ISLPED '00.

[11]  EmerJoel,et al.  High performance cache replacement using re-reference interval prediction (RRIP) , 2010 .

[12]  Xi Zhang,et al.  A Cache Replacement Policy Using Adaptive Insertion and Re-reference Prediction , 2010, 2010 22nd International Symposium on Computer Architecture and High Performance Computing.

[13]  J. Spencer Love,et al.  Caching strategies to improve disk system performance , 1994, Computer.

[14]  Aamer Jaleel,et al.  Adaptive insertion policies for managing shared caches , 2008, 2008 International Conference on Parallel Architectures and Compilation Techniques (PACT).

[15]  Sang Lyul Min,et al.  LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies , 2001, IEEE Trans. Computers.

[16]  Hiroaki Kobayashi,et al.  Locality analysis to control dynamically way-adaptable caches , 2005, SIGARCH Comput. Archit. News.

[17]  Gabriel H. Loh,et al.  PIPP: promotion/insertion pseudo-partitioning of multi-core shared caches , 2009, ISCA '09.

[18]  Aamer Jaleel,et al.  High performance cache replacement using re-reference interval prediction (RRIP) , 2010, ISCA.

[19]  Ronald G. Dreslinski,et al.  The M5 Simulator: Modeling Networked Systems , 2006, IEEE Micro.

[20]  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).