Advertisement

Performance of Memory Expansion Technology (MXT)

  • Dan E. Poff
  • Mohammad Banikazemi
  • Robert Saccone
  • Hubertus Franke
  • Bulent Abali
  • T. Basil Smith

Abstract

A novel memory subsystem called Memory Expansion Technology (MXT) has been built for fast hardware compression of main memory contents. This allows a system with memory expansion to present a real memory larger than the physically available memory. This chapter provides an overview of the memory compression architecture, the OS support, and an analysis of the performance impact of memory compression while running multiple benchmarks. Results show that the hardware compression of main memory has a negligible penalty compared to an uncompressed memory, and for memory starved applications it increases performance significantly. We also show that an applications’ memory contents can be compressed usually by a factor of 2.

Keywords

Compression Ratio Main Memory Memory Size Standard System Cache Line 
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.
    B. Abali and H. Franke. Operating System Support for Fast Hardware Compression of Main Memory. In Memory Wall Workshop, June 2000, also published as IBM Research Report No. RC21964, IBM, Yorktown Heights, NY.Google Scholar
  2. 2.
    B. Abali, H. Franke, D.E. Poff, R. Saccone, C. Schulz, L. Herger, and T.B. Smith. Memory Expansion Technology (MXT): Software Support and Performance. IBM Journal of Research and Development, 2:287–302, 2001.CrossRefGoogle Scholar
  3. 3.
    B. Abali, H. Franke, D.E. Poff, X. Shen, and T.B. Smith. Performance of Hardware Compressed Main Memory. In Proceedings of The Seventh International Symposium on High Performance Computer Architecture (HPCA-7), pages 73–81, January 2001.Google Scholar
  4. 4.
    I.-C.K. Chen, J.T. Coffey, and T.N. Mudge. Analysis of Branch Prediction via Data Compression. Computer Architecture News, 24:128–137, October 1996.Google Scholar
  5. 5.
    P. Franaszek, P. Heidelberger, D.E. Poff, and J. Robinson. Algorithms and Data Structures for Compressed Memory Machines. IBM Journal of Research and Development, 2:245–258, 2001.CrossRefGoogle Scholar
  6. 6.
    P. Franaszek, P. Heidelberger, and M. Wazlowski. On Management of Free Space in Compressed Memory Systems. In Proceedings of the ACM Sigmetrics Conference, pages 113–121, June 1999.Google Scholar
  7. 7.
    P. Franaszek and J. Robinson. On Internal Organizations in Compressed Random Access Memories. IBM Journal of Research and Development, 2:259–270, 2001.CrossRefGoogle Scholar
  8. 8.
    P. Franaszek, J. Robinson, and J. Thomas. Compression architecture for system memory application. In Proceedings of the Data Compression Conference (DCC), pages 200–209, 1996.Google Scholar
  9. 9.
    J. Kalamatianos and D.R. Kaeli. Predicting Indirect Branches via Data Compression. In Proceedings of the Annual International Symposium on Microarchitecture, pages 272–281, 1998.Google Scholar
  10. 10.
    M. Kjelso, M. Gooch, and S. Jones. Empirical Study of Memory Data: Characteristics and Compressibility. IEE Proceedings on Computers and Digital Techniques, 45(1):63–67, 1998.CrossRefGoogle Scholar
  11. 11.
    S.Y. Larin and T.M. Conte. Compiler-Driven Cached Code Compression Schemes for Embedded ILP Processors. In Proceedings of the Annual International Symposium on Microarchitecture, pages 82–92, 1999.Google Scholar
  12. 12.
    D. A. Luick, J.D. Brown, K.H. Haselhorst, S.W. Kerchberger, and W.P. Hovis. Compression Architecture for System Memory Application. US Patent 5,812,817, 1998.Google Scholar
  13. 13.
    R. Tremaine, P. Franaszek, J. Robinson, C. Schulz, T.B. Smith, M. Wazlowski, and M. Bland. IBM Memory eXpansion Technology (MXT). IBM Journal of Research and Development, 2:271–286, 2001.CrossRefGoogle Scholar
  14. 14.
    P. Wilson, S. Kaplan, and Y. Smaragdakis. The Case for Compressed Caching in Virtual Memory Systems. In Proceedings of the USENIX Annual Technical Conference, 1999.Google Scholar

Copyright information

© Springer Science+Business Media New York 2004

Authors and Affiliations

  • Dan E. Poff
    • 1
  • Mohammad Banikazemi
    • 1
  • Robert Saccone
    • 1
  • Hubertus Franke
    • 1
  • Bulent Abali
    • 1
  • T. Basil Smith
    • 1
  1. 1.IBM T.J.Watson Research CenterYorktown HeightsUSA

Personalised recommendations