CareDedup: cache-aware deduplication for reading performance optimization in primary storage

Authors:
Bin Lin;Shanshan Li;Xiangke Liao
Affiliations:
National University of Defense Technology;National University of Defense Technology;National University of Defense Technology
Venue:
Proceedings Demo & Poster Track of ACM/IFIP/USENIX International Middleware Conference
Year:
2013

Citing 3
Cited 0

I/O deduplication: utilizing content similarity to improve I/O performance

FAST'10 Proceedings of the 8th USENIX conference on File and storage technologies
iDedup: latency-aware, inline data deduplication for primary storage

FAST'12 Proceedings of the 10th USENIX conference on File and Storage Technologies
Locality Principle Revisited: A Probability-Based Quantitative Approach

IPDPS '12 Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

Deduplication technology has been increasingly used to reduce the primary storage cost, while it often causes additional on-disk fragmentation that impairs the reading performance. Existing deduplication algorithms mainly focus on the static data layout design so that the random I/O requests are largely avoided and the harmful effect can be alleviated. However, our trace-driven emulations show that, deduplication does not always impair the reading. It offers unique new opportunities for reading performance optimization by more possible cache hits. Motivated by this, we propose a novel cache-aware deduplication scheme CareDedup to well leverage the new opportunities. Based on a uniform locality assessment algorithm design, CareDedup selects the most profitable duplicated blocks to deduplicate for maximizing the reading performance.