ACM Home Page
Please provide us with feedback. Feedback
Skewed caches from a low-power perspective
Full text PdfPdf (214 KB)
Source Conference On Computing Frontiers archive
Proceedings of the 2nd conference on Computing frontiers table of contents
Ischia, Italy
SESSION: Track 3: high performance embedded architectures (part 1) table of contents
Pages: 152 - 160  
Year of Publication: 2005
ISBN:1-59593-019-1
Authors
Mathias Spjuth  Uppsala University, Uppsala, Sweden
Martin Karlsson  Uppsala University, Uppsala, Sweden
Erik Hagersten  Uppsala University, Uppsala, Sweden
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 24,   Citation Count: 1
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/1062261.1062289
What is a DOI?

ABSTRACT

The common approach to reduce cache conflicts is to increase the associativity. From a dynamic power perspective this associativity comes at a high cost. In this paper we present miss ratio performance and a dynamic power comparison for set-associative caches, a skewed cache and also for a new organization proposed,the elbow cache. The elbow cache extends the skewed cache organization with a relocation strategy for conflicting blocks. We show that these skewed designs significantly reduce the conflict problems while consuming p to 56% less dynamic power than a comparably performing 8-way set associative cache. We believe this to be the strongest case in favor of skewed caches presented so far


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
Sun's Niagara Pours on the Cores.Microprocessor Report Newsletter,September 2004.
 
2
3
 
4
 
5
 
6
L. A. Belady. A study of replacement algorithms for a virtual storage computer. IBM Systems Journal, 5:78--101, 1966.
7
 
8
9
10
11
 
12
R. Heald, K. Shin, V. Reddy, I.-F. Kao, M. Khan, W. L. Lynch,G. Lauterbach, and J. Petolino. 64kB Sum-Addressed-Memory Cache with 1.6ns Cycle and 2.6ns Latency.IEEE Journal of Solid-State Circuits 33, page 1682--1689, 1998.
 
13
 
14
J. Jalminger and P. Stenström. Improvements of Energy-Efficiency in Off-Chip Caches by Selective Prefetching. Microprocessors and Microsystems, 2001.
 
15
 
16
M. Karlsson and E. Hagersten. Timestamp-based Selective Cache Allocation. In Proceedings of the Workshop on Memory Performance Issues, June 2001. held in conjunction with the 28th International Symposium on Computer Architecture (ISCA28).
 
17
18
 
19
 
20
21
 
22
 
23
24
25
 
26
A. Seznec. A new case for skewed-associativity. Internal Publication No 1114, IRISA-INRIA, July 1997.
 
27
 
28
P. Shivakumar and N. Jouppi. CACTI 3.0 An integrated Cache Timing, Power and Area Model. Technical Report 2001/2, DEC Western Research Lab, 2001.
29
 
30
Hans Vandierendonck and Koen De Bosschere. Trade-offs for Skewed-Associative Caches. In Parallel Computing (PARCO), September 2003.
 
31
 
32
S. Wilton and N. Jouppi. An enhanced access and cycle time model for on-chip caches, 1994.
 
33
34
 
35
Michael Zhang and Krste Asanovic. Highly-Associative Caches for Low-Power Processors. In Proceedings of Kool Chips Workshop held in conjunction with International Symposium on Microarchitecture (MICRO-33), Monterey, CA, December, 2000.


Collaborative Colleagues:
Mathias Spjuth: colleagues
Martin Karlsson: colleagues
Erik Hagersten: colleagues