The case for compressed caching in virtual memory systems

Proceedings of the 1999 USENIX Annual Technical Conference

Volumn , Issue , 1999, Pages

  Wilson, Paul R ^a   Kaplan, Scott F ^a   Smaragdakis, Yannis ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSION ALGORITHMS; DATA REPRESENTATIONS; PAGING COSTS; PERFORMANCE GAPS; PROGRAM BEHAVIOR; TECHNOLOGY TRENDS; VIRTUAL MEMORY; VIRTUAL MEMORY SYSTEMS;

RANDOM ACCESS STORAGE;

EID: 85084162609     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Andrew W. Appel and Kai Li. Virtual memory primitives for user programs. In Fourth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS IV), pages 96-107, Santa Clara, California, April 1991.
2. Timothy C. Bell, John G. Cleary, and Ian H. Witten. Text Compression. Prentice Hall, Englewood Cliffs, New Jersey, 1990.
3. Fred Douglis. The compression cache: Using on-line compression to extend physical memory. In Proceedings of 1993 Winter USENIX Conference, pages 519-529, San Diego, California, January 1993.
4. Jens Ernst, William Evans, Christopher W. Fraser, Steven Lucco, and Todd A. Proebsting. Code compression. In Proceedings of the 1997 SIGPLAN Conference on Programming Language Design and Implementation, Las Vega, Nevada, June 1997. ACM Press.
5. Morten Kjelso, M. Gooch, and S. Jones. Main memory hardware data compression. In 22nd Euromicro Conference, pages 423-430. IEEE Computer Society Press, September 1996.
6. M. Kjelso, M. Gooch, and S. Jones. Performance evaluation of computer architectures with main memory data compression. In Journal of Systems Architecture 45, pages 571-590. Elsevier Science, 1999.
7. Mark Nelson. The Data Compression Book (2nded.). M & TBooks, 1995.
8. Mark Russinovich and Bryce Cogswell. RAM compression analysis, February 1996. O'Reilly Online Publishing Report available from http://ftp.uni-mannheim.de/info/OReilly/windows/win95.update/model.html.
9. Luigi Rizzo. A very fast algorithm for RAM compression. In Operating Systems Review 311997, pages 36-45, 1997.
10. Walter R. Smith and Robert V. Welland. A model for address-oriented software and hardware. In 25th Hawaii International Conference on Systems Sciences, January 1991.
11. Paul R. Wilson. Some issues and strategies in heap management and memory hierarchies. In OOPSLA/ECOOP '90 Workshop on Garbage Collection in Object-Oriented Systems, October 1990.
12. Also appears in SIGPLAN Notices 23(3):45-52, March 1991.
13. Ross N. Williams. An extremely fast Ziv-Lempel compression algorithm. In Data Compression Conference, pages 362-371, April 1991.
14. Paul R. Wilson. Operating system support for small objects. In International Workshop on Object Orientation in Operating Systems, pages 80-86, Palo Alto, California, October 1991. IEEE Press.
15. Paul R. Wilson, Mark S. Johnstone, Michael Neely, and David Boles. Dynamic storage allocation: A survey and critical review. In 1995 International Workshop on Memory Management, Kinross, Scotland, UK, 1995. Springer Verlag LNCS.
16. Paul R. Wilson, Scott F. Kaplan, and V.B. Balayoghan. Virtual memory reference tracing using user-level access protections. In Preparation.
17. Paul R. Wilson, Michael S. Lam, and Thomas G. Moher. Effective static-graph reorganization to improve locality in garbage-collected systems. In Proceedings of the 1991 SIGPLAN Conference on Programming Language Design and Implementation, pages 177-191, Toronto, Ontario, June 1991. ACM Press.
18. Published as SIGPLAN Notices 26(6), June 1992.
19. Tong Lai Yu. Data compression for PC software distribution. Software Practice and Experience, 26(11):1181-1195, November 1996.