DocumentCode
644414
Title
Evaluating Memory Compression and Deduplication
Author
Yuhui Deng ; Liangshan Song ; Xinyu Huang
Author_Institution
Comput. Sci. Dept., Jinan Univ., Guangzhou, China
fYear
2013
fDate
17-19 July 2013
Firstpage
282
Lastpage
286
Abstract
Many programs require more RAM to hold their data than a typical computer has. Theoretically, both the compression and deduplication can trade the rich computing capacity for more available RAM space. This paper comprehensively evaluates the performance behaviour of memory compression and memory deduplication by using seven real memory traces. The experimental results give two implications: (1) Memory deduplication greatly outperforms memory block compression. (2) Fixed-size partition (FSP) achieves the best performance in contrast to Content-defined Chunking (CDC) and Sliding Block (SB). The optimal chunking size of FSP is equal to the size of a memory page. The analysis results in this paper should be able to provide useful insights for designing or implementing systems that require abundant memory resources to enhance the system performance.
Keywords
random-access storage; storage management; CDC; FSP; RAM; SB; content-defined chunking; fixed-size partition; memory block compression; memory deduplication; memory page; memory resources; memory traces; random access memory; sliding block; system performance; Compression algorithms; Computers; Data compression; Dictionaries; Encoding; Memory management; Random access memory; compression; deduplication; memory data;
fLanguage
English
Publisher
ieee
Conference_Titel
Networking, Architecture and Storage (NAS), 2013 IEEE Eighth International Conference on
Conference_Location
Xi´an
Type
conf
DOI
10.1109/NAS.2013.45
Filename
6665378
Link To Document