2000
DOI: 10.1002/(sici)1097-024x(20000425)30:5<567::aid-spe312>3.0.co;2-z
|View full text |Cite
|
Sign up to set email alerts
|

Swap compression: resurrecting old ideas

Abstract: The performance of memory-intensive applications tends to be poor due to the high overhead added by the swapping mechanism. The same problem may be found in highly-loaded multi-programming systems where all running applications have to use the swap space in order to be able to execute at the same time.In this paper, we present a solution to these problems. The idea consists of compressing the swapped pages and keeping them in a swap cache whenever possible.The idea of a compressed swap cache was proposed a few… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2004
2004
2013
2013

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…Both portions compete for the LRU page in memory, and allocating a new page is biased towards the compression cache. Cortes, et al [11] classify reads to the compression cache according to whether they were caused by swapping or prefetching, and propose optimized mechanisms to swap pages in/out. Wilson, et al [41] propose dynamically adjusting the compressed cache size using a cost/benefit analysis that compares various target sizes, and takes into account the compression cost vs. the benefit of avoiding I/Os.…”
Section: Related Workmentioning
confidence: 99%
“…Both portions compete for the LRU page in memory, and allocating a new page is biased towards the compression cache. Cortes, et al [11] classify reads to the compression cache according to whether they were caused by swapping or prefetching, and propose optimized mechanisms to swap pages in/out. Wilson, et al [41] propose dynamically adjusting the compressed cache size using a cost/benefit analysis that compares various target sizes, and takes into account the compression cost vs. the benefit of avoiding I/Os.…”
Section: Related Workmentioning
confidence: 99%
“…Shared memory issues, however, have not been addressed in this system (Geva & Wiseman, 2007). Cortes, Becerra, & Cervera (2000) also investigated the implementation of the Swap compression mechanism in the Linux kernel to improve performance and reduce memory requirements. It seems natural to assume that if the compression of the swap pages which are saved in a storage device produces a significant improvement then, for similar considerations, so would the compression of the rest of the files in the storage device.…”
Section: Software Based Memory Compressionmentioning
confidence: 99%