TY - GEN
T1 - Leakage energy management in cache hierarchies
AU - Li, L.
AU - Kadayif, I.
AU - Tsai, Y. F.
AU - Vijaykrishnan, N.
AU - Kandemir, M.
AU - Irwin, M. J.
AU - Sivasubramaniam, A.
N1 - Publisher Copyright:
© 2002 IEEE.
PY - 2002
Y1 - 2002
N2 - Energy management is important for a spectrum of systems ranging from high-performance architectures to low-end mobile and embedded devices. With the increasing number of transistors, smaller feature sizes, lower supply and threshold voltages, the focus on energy optimization is shifting from dynamic to leakage energy. Leakage energy is of particular concern in dense cache memories that form a major portion of the transistor budget. In this work, we present several architectural techniques that exploit the data duplication across the different levels of cache hierarchy. Specifically, we employ both state-preserving (data-retaining) and state-destroying leakage control mechanisms to L2 subblocks when their data also exist in L1. Using a set of media and array-dominated applications, we demonstrate the effectiveness of the proposed techniques through cycle-accurate simulation. We also compare our schemes with the previously proposed cache decay policy. This comparison indicates that one of our schemes generates competitive results with cache decay.
AB - Energy management is important for a spectrum of systems ranging from high-performance architectures to low-end mobile and embedded devices. With the increasing number of transistors, smaller feature sizes, lower supply and threshold voltages, the focus on energy optimization is shifting from dynamic to leakage energy. Leakage energy is of particular concern in dense cache memories that form a major portion of the transistor budget. In this work, we present several architectural techniques that exploit the data duplication across the different levels of cache hierarchy. Specifically, we employ both state-preserving (data-retaining) and state-destroying leakage control mechanisms to L2 subblocks when their data also exist in L1. Using a set of media and array-dominated applications, we demonstrate the effectiveness of the proposed techniques through cycle-accurate simulation. We also compare our schemes with the previously proposed cache decay policy. This comparison indicates that one of our schemes generates competitive results with cache decay.
UR - https://www.scopus.com/pages/publications/84948762407
UR - https://www.scopus.com/inward/citedby.url?scp=84948762407&partnerID=8YFLogxK
U2 - 10.1109/PACT.2002.1106012
DO - 10.1109/PACT.2002.1106012
M3 - Conference contribution
AN - SCOPUS:84948762407
T3 - Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT
SP - 131
EP - 140
BT - Proceedings - 2002 International Conference on Parallel Architectures and Compilation Techniques, PACT 2002
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - International Conference on Parallel Architectures and Compilation Techniques, PACT 2002
Y2 - 22 September 2002 through 25 September 2002
ER -