The Case for Compressed Caching in Virtual Memory Systems (1999) [38 citations — 2 self]
http://www.cs.amherst.edu/~sfkaplan/papers/compres
http://www.usenix.org/events/usenix01/cfp/wilson/w
DBLP
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Paul R. Wilson and Scott F. Kaplan and Yannis Smaragdakis},
title = {The Case for Compressed Caching in Virtual Memory Systems},
booktitle = {In Proceedings of the 1999 USENIX Annual Technical Conference},
year = {1999},
pages = {101--116},
publisher = {USENIX Association}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
Compressed caching uses part of the available RAM to hold pages in compressed form, effectively adding a new level to the virtual memory hierarchy. This level attempts to bridge the huge performance gap between normal (uncompressed) RAM and disk. Unfortunately, previous studies did not show a consistent benefit from the use of compressed virtual memory. In this study, we show that technology trends favor compressed virtual memory---it is attractive now, offering reduction of paging costs of several tens of percent, and it will be increasingly attractive as CPU speeds increase faster than disk speeds. Two of the elements of our approach are innovative. First, we introduce novel compression algorithms suited to compressing in-memory data representations. These algorithms are competitive with more mature ZivLempel compressors, and complement them. Second, we adaptively determine how much memory (if at all) should be compressed by keeping track of recent program behavior. This solves the p...
Citations
No citations identified.
