ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Compression in cache design
Full text PdfPdf (441 KB)
Source
International Conference on Supercomputing archive
Proceedings of the 21st annual international conference on Supercomputing table of contents
Seattle, Washington
SESSION: Architecture -- memory hierarchy table of contents
Pages: 190 - 201  
Year of Publication: 2007
ISBN:978-1-59593-768-1
Authors
Ali-Reza Adl-Tabatabai  Intel Corporation
Anwar M. Ghuloum  Intel Corporation
Shobhit O Kanaujia  Intel Corporation
Sponsor
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 49,   Citation Count: 0
Additional Information:

abstract   references   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/1274971.1274999
What is a DOI?

ABSTRACT

Increasing cache capacity via compression enables designers to improve performance of existing designs for small incremental cost, further leveraging the large die area invested in last level caches. This paper explores the compressed cache design space with focus on implementation feasibility.

Our compression schemes use companion line pairs -- cache lines whose addresses differ by a single bit -- as candidates for compression. We propose two novel compressed cache organizations: the companion bit remapped cache and the pseudoassociative cache. Our cache organizations use fixed-width physical cache line implementation while providing a variablelength logical cache line organization, without changing the number of sets or ways and with minimal increase in state per tag. We evaluate banked and pairwise schemes as two alternatives for storing compressed companion pairs within a physical cache line. We evaluate companion line prefetching (CLP), a simple yet effective prefetching mechanism that works in conjunction with our compression scheme. CLP is nearly pollution free since it only prefetches lines that are compression candidates.

Using a detailed cycle accurate IA-32 simulator, we measure the performance of several third-level compressed cache designs simulating a representative collection of workloads. Our experiments show that our cache compression designs improve IPC for all cache-sensitive workloads, even those with modest data compressibility. The pairwise pseudo-associative compressed cache organization with companion line prefetching is the best configuration, providing a mean IPC improvement of 19% for cache-sensitive workloads, and a best-case IPC improvement of 84%. Finally, our cache designs exhibit negligible overall IPC degradation for cache-insensitive workloads.


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
 
7
 
8
Tremaine R., Fanaszek P., Robinson J., Schulz C., Smith T., Wazlowski, M., and Bland, P., "IBM Memory Expansion Technology (MXT)", in IBM Journal of Research and Development, Vol. 45, No. 2, March 2001.
 
9
10
11
 
12
Kjelso, M., Gooch, M., Jones, S., "Main memory hardware data compression", 22<sup>nd</sup> Euromicro Conference, IEEE Computer Society Press, September 1996.
13
 
14
15
 
16
Singhal, R.; Venkatraman, K. S.; Cohn, E.; Holm, J. G.; Koufaty, D; Lin, M-.J.; Madhav, M.; Mattwandel, M.; Nidhi, N.; Pearce, J.; Seshadri, M. "Performance Analysis and Validation of the Intel® Pentium® 4 Processor on 90nm Technology." Intel Technology Journal. http://developer.intel.com/technology/itj/2004/volume08issue01/(February 2004).
 
17
Gochman, S.; Ronen, R.; Anati, I.; Berkovits, A.; Kurts, T.; Naveh, A.; Saeed, A.;Sperber, Z.; and Valentine, R. "The Intel® Pentium® M Processor: Microarchitecture and Performance.", Intel Technology Journal, http://developer.intel.com/technology/itj/2003/volume07issue02/ (May 2003).
18
19
 
20
 
21
Y. Zhang and R. Gupta, "Enabling Partial Cache Line Prefetching Through Data Compression", International Conference on Parallel Processing, pages 277--285, Kaohsiung, Taiwan, October 2003
 
22
Gailly, J. and Adler, M., "Zlib general purpose compression library", User manual for zlib version 1.0.4, URL: http://quest.jpl.nasa.gov/zlib/, July 1996
23
 
24
A. Alameldeen, D. Wood, "Interactions Between Compression and Prefetching in Chip Multiprocessors", in proceeding of 13<sup>th</sup> International Symposium on High-Performance Computer Architecture, 2007.

Collaborative Colleagues:
Ali-Reza Adl-Tabatabai: colleagues
Anwar M. Ghuloum: colleagues
Shobhit O Kanaujia: colleagues