Title: Performance Analysis of Compressed Caching Technique
Year of Publication: 2015
Publisher: International Journal of Computer Systems (IJCS)
ISSN: 2394-1065
Series: Volume 2, Number 12
Authors: Aman Kumar, Shubham Girdhar


Aman Kumar, Shubham Girdhar, "Performance Analysis of Compressed Caching Technique", International Journal of Computer Systems (IJCS), 2(12), pp: 526-529, December 2015. BibTeX

	author = {Aman Kumar, Shubham Girdhar},
	title = {Performance Analysis of Compressed Caching Technique},
	journal = {International Journal of Computer Systems (IJCS)},
	year = {2015},
	volume = {2},
	number = {12},
	pages = {526-529},
	month = {December}


Compressed Caching (virtual memory compression) is the technique that attempts to reduce the request for paging from secondary storage. There is a huge performance gap in accessing primary memory (RAM) and secondary storage (Disk). Compressed caching technique intercepts the pages to be swapped out, compresses them and stores them in pool allocated in RAM. Hence it tries to fill the performance gap by adding a new level to virtual memory hierarchy. This paper presents the performance analysis of the virtual memory compression on various parameters such as workload, size of RAM. The results are displayed in the form of efficiency graphs to show the increase in performance of physical memory using compressed caching technique over normal operation.


[1] Paul R. Wilson, Scott F. Laplan, and YannisSmaragdakis, “The Case for Compressed Caching in Virtual Memory Systems”, Proceedings of USENIX of Annual Technical Conference Monterey, California, USA: June 6-11, 1999.
[2] Andrew W. Appel and Kai Li, “Virtual memory primitives for user programs”, Fourth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS IV), Santa Clara, California: April 1991, pp. 96- 107.
[3] Fred Douglis, “The compression cache: Using on-line compression to extend physical memory”, Proceedings of 1993 Winter USENIX Conference, San Diego, California: January 1993, pp. 519–529.
[4] M. Kjelso, M. Gooch, and S. Jones, “Performance evaluation of computer architectures with main memory data compression”, Journal of Systems Architecture 45: 1999, pp. 571-590.
[5] R. Carvera, T. Cortes, and Y Becerra, “Improving Application Performance through Swap Compression”, In Usenix ’99 – Freenix Refereed Track: 1999.
[6] Ross N Williams, “An extremely fast Ziv-Lempel compression algorithm”, Data Compression Conference: April 1991, pp. 362– 371.
[7] 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.
[8] Alaa R. Alameldeen and David A. Wood, “Adaptive Cache Compression for High-Performance Processors”, proceedings of the 31st Annual International Symposium on Computer Architecture (ISCA-31) Munich, Germany: June 19-23, 2004.
[9] Luca Benini, DavideBruni, Bruno Ricco, Alberto Macii, and Enrico Macii, “An Adaptive Data Compression Scheme for Memory Traffic Minimization in Processor-Based Systems”, In Proceedings of the IEEE International Conference on Circuits and Systems, ICCAS-02: May 2002, pp. 866–869.
[10] Toni Cortes, Yolanda Becerra, and Raul Cervera, “Swap Compression: Resurrecting Old Ideas”, Software – Practice and Experience Journal, 46(15): December 2000, pp. 567–587.
[11] Michael J. Freedman, “The Compression Cache: Virtual Memory Compression for Handheld Computers”, Technical report, Parallel and Distributed Operating Systems Group, MIT Lab for Computer Science, Cambridge: 2000.
[12] S. F., Kaplan, “Compressed Caching and Modern Virtual Memory Simulation”, PhD thesis, University of Texas at Austin: 1999.


Virtual memory, Zswap, zbud, frontswap, LZO, PSO, SO, pool limit hit.