ACM Home Page
Please provide us with feedback. Feedback
Let caches decay: reducing leakage energy via exploitation of cache generational behavior
Full text PdfPdf (873 KB)
Source ACM Transactions on Computer Systems (TOCS) archive
Volume 20 ,  Issue 2  (May 2002) table of contents
Pages: 161 - 190  
Year of Publication: 2002
ISSN:0734-2071
Authors
Zhigang Hu  Princeton University, Princeton, NJ
Stefanos Kaxiras  Agere Systems, Murray Hill, NJ
Margaret Martonosi  Princeton University, Princeton, NJ
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 50,   Citation Count: 11
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/507052.507055
What is a DOI?

ABSTRACT

Power dissipation is increasingly important in CPUs ranging from those intended for mobile use, all the way up to high-performance processors for highend servers. Although the bulk of the power dissipated is dynamic switching power, leakage power is also beginning to be a concern. Chipmakers expect that in future chip generations, leakage's proportion of total chip power will increase significantly. This article examines methods for reducing leakage power within the cache memories of the CPU. Because caches comprise much of a CPU chip's area and transistor counts, they are reasonable targets for attacking leakage. We discuss policies and implementations for reducing cache leakage by invalidating and "turning off" cache lines when they hold data not likely to be reused. In particular, our approach is targeted at the generational nature of cache line usage. That is, cache lines typically have a flurry of frequent use when first brought into the cache, and then have a period of "dead time" before they are evicted. By devising effective, low-power ways of deducing dead time, our results show that in many cases we can reduce L1 cache leakage energy by 4x in SPEC2000 applications without having an impact on performance. Because our decay-based techniques have notions of competitive online algorithms at their roots, their energy usage can be theoretically bounded at within a factor of two of the optimal oracle-based policy. We also examine adaptive decay-based policies that make energy-minimizing policy choices on a per-application basis by choosing appropriate decay intervals individually for each cache line. Our proposed adaptive policies effectively reduce L1 cache leakage energy by 5x for the SPEC2000 with only negligible degradations in performance.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
 
4
5
 
6
Burger, D., Austin, T. M., and Bennett, S. 1996. Evaluating future microprocessors: The SimpleScalar tool set. Tech. Rep. TR-1308 (July), Univ. of Wisconsin---Madison Computer Sciences Dept.
 
7
Burger, D., Goodman, J., and Kagi, A. 1995. The declining effectiveness of dynamic caching for general-purpose microprocessors. Tech. Rep. TR-1216, Univ. of Wisconsin---Madison Computer Sciences Dept.
8
9
 
10
 
11
 
12
Gwennap, L. 1996. Digital 21264 sets new standard. Microproc. Rep. 11--16.
13
 
14
IBM Corp. 2000. Personal communication. November.
 
15
Intel Corp. 1997. Intel architecture optimization manual.
16
17
 
18
19
20
21
 
22
23
24
25
26
 
27
Sair, S. and Charney, M. 2000. Memory behavior of the SPEC2000 benchmark suite. Tech. Rep., IBM.
 
28
Semiconductor Industry Association. 1999. The International Technology Roadmap for Semiconductors. Available at http://www.semichips.org.
 
29
Stallings, W. 2001. Operating Systems. Prentice-Hall, Englewood Cliffs, N.J.
 
30
The Standard Performance Evaluation Corporation. 2000. WWW Site. http://www.spec.org.
 
31
U.S. Environmental Protection Agency. 2001. Energy Star Program Web page. http://www. epa.gov/energystar/.
32
33
 
34
35
 
36

CITED BY  11

Collaborative Colleagues:
Zhigang Hu: colleagues
Stefanos Kaxiras: colleagues
Margaret Martonosi: colleagues