ICESS 2007: Embedded Software and Systems pp 142-153 | Cite as

A Unified Compressed Cache Hierarchy Using Simple Frequent Pattern Compression and Partial Cache Line Prefetching

  • Xinhua Tian
  • Minxuan Zhang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4523)

Abstract

In this paper, we propose a novel compressed cache hierarchy that uses a unified compression algorithm in both L1 data cache and L2 cache, called Simple Frequent Pattern Compression(S-FPC). This scheme can increase the cache capacity of L1 data cache and L2 cache without any sacrifice of the L1 cache access latency. The layout of compressed data in L1 data cache enables partial cache line prefetching and does not introduce prefetch buffers or increase cache pollution and memory traffic. Compared to a baseline cache hierarchy not supporting data compression in cache, on average, our cache hierarchy design increases the average L1 cache capacity(in terms of the average number of valid words in cache per cycle) by about 33%, reduces the data cache miss rate by 21%, and speeds up program execution by 13%.

Keywords

Compression Technique Compression Scheme Cache Line Cache Hierarchy Cache Capacity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Hennessy, J., Patterson, D.: Computer Architecture: A Quantitative Approach. Morgan Kaufmann, San Francisco (1996)MATHGoogle Scholar
  2. 2.
    Alameldeen, A., Wood, D.: Adaptive Cache Compression for High-Performance Processor. In: Proc. ISCA-31 (2004)Google Scholar
  3. 3.
    Chen, D., Peserico, E., Rudolph, L.: A Dynamically Partitionable Compressed Cache. In: Proceeding of the Singapore-MIT Alliance Symposium (January 2003)Google Scholar
  4. 4.
    Lee, J.-S., Hong, W.-K., Kim, S.-D.: Design and Evaluation of a Selective Compressed Memory System. In: Proceedings of International Conference on Computer Design (ICCD’99), October 1999, pp. 184–191 (1999)Google Scholar
  5. 5.
    Lee, J.-S., Hong, W.-K., Kim, S.-D.: Adaptive Methods to Minimize Decompression Overhead for Compressed On-chip Cache. International Journal of Computers and Application 25(2) (2003)Google Scholar
  6. 6.
    Yang, J., Zhang, Y., Gupta, R.: Frequent Value Compression in Data Caches. In: Proceedings of the 33rd Annual IEEE/ACM International Symposium on Microarchitecture, December 2000, pp. 258–265 (2000)Google Scholar
  7. 7.
    Hallnor, E., Reinhardt, S.: A Unified Compressed Memory Hierarchy. In: Proceedings of the 11th Int’l Symposium on High-Performance Computer Architecture, HPCA-11 (2005)Google Scholar
  8. 8.
    Franaszek, P., Robinson, J., Thomas, J.: Parallel Compression with Cooperative Dictionary Construction. In: Proc. Data Compression Conf., pp. 200–209 (1996)Google Scholar
  9. 9.
    Abali, B., Franke, H., Xiaowei, S., et al.: Performance of Hardware Compressed Main Memory. In: Proc. 7th Int’l Symp. on High-Performance Computer Architecture, pp. 73–81 (2001)Google Scholar
  10. 10.
    Burger, D., Austin, T.M.: The SimpleScalar Tool Set, Version 2.0. Computer Arch. News (1997)Google Scholar
  11. 11.
    Alameldeen, A.R., Wood, D.A.: Frequent Pattern Compression: A Significance-Based Compression Scheme for L2 Caches. Technical Report 1500, Computer Sciences Department, University of Wisconsin-Madison (April 2004)Google Scholar
  12. 12.
    Kjelso, M., et al.: Design and Performance of a Main Memory Hardware Data Compressor. In: Proc. EUROMICRO Conference (1996)Google Scholar
  13. 13.
    Zhang, Y., et al.: Frequent Value Locality and Value Centric Data Cache Design. In: Proc. ASPLOS (2000)Google Scholar
  14. 14.
    Pujara, P., Aggarwal, A.: Restrictive Compression Techniques to Increase Level 1 Cache Capacity. In: International Conference on Computer Design (2005)Google Scholar
  15. 15.
    Zhang, Y., Gupta, R.: Enabling Partial Cache Line Prefetching Through Data Compression. In: ICPP 2000, pp. 277–285 (2003), http://www.informatik.uni-trier.de/~ley/db/conf/icpp/icpp2003.html
  16. 16.
    Lee, J.-S., Hong, W.-K., Kim, S.-D.: Design and Evaluation of a Selective Compressed Memory System. In: Proceedings of International Conference on Computer Design (ICCD’99), October 1999, pp. 184–191 (1999)Google Scholar
  17. 17.
    Arramreddy, S., Har, D., Mak, K., et al.: IBM X-Press Memory Compression Technology Debuts in a ServerWorks NorthBridge. In: Hot Chips 12 (2000)Google Scholar
  18. 18.
    Lee, J.S., Hong, W.K., Kim, S.D.: An on-chip cache compression technique to reduce decompression overhead and design complexity. Journal of Systems Architecture 46, 1365–1382 (2000)CrossRefGoogle Scholar
  19. 19.
    Roy, S., Kumar, R., Prvulovic, M.: Improving System Performance with Compressed Memory. In: Proc. 15th Int’l Parallel and Distributed Processing Symp., Apr. 2001, pp. 630–636 (2001)Google Scholar
  20. 20.
    Kumar, S., Pujara, P., Aggarwal, A.: Bit-Sliced Datapath for Energy-Efficient High Performance Microprocessors. In: Falsafi, B., VijayKumar, T.N. (eds.) PACS 2004. LNCS, vol. 3471, pp. 30–45. Springer, Heidelberg (2005)CrossRefGoogle Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Xinhua Tian
    • 1
  • Minxuan Zhang
    • 1
  1. 1.Department of Computer Science, National University of Defense Technology, Changsha, Hunan, 410073China

Personalised recommendations