.png){kind=icon}
返回
Accelerating Content-Defined Chunking for Data Deduplication Based on Speculative Jump
.png){kind=icon}
OA
AI
DOI：10.1109/TPDS.2023.3290770.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In data deduplication systems, chunking has a significant impact on the deduplication ratio and throughput. Existing Content-Defined Chunking (CDC) approaches exploit a sliding window to calculate rolling hashes of the input data stream byte-by-byte, and then determine chunk cut-points if the rolling hash satisfies a given cut-condition. Since previous CDC approaches are extremely costly, it often significantly degrades the throughput of data deduplication systems. In this paper, we argue that calculating and checking the rolling hashes byte-by-byte is unnecessary. To reduce the CPU overhead of CDC, we propose a jump-based chunking (JC) approach. The key idea is to introduce a jump-condition, and the sliding window can jump over a specific length of the input data stream if the rolling hashes satisfy the jump-condition. Moreover, we also explore the impact of the cut-condition and the jump-condition on the chunk size. Our theoretic studies demonstrate the effectiveness and efficiency of JC, without compromising the deduplication ratio. Experimental results show that JC improves the throughput of chunking by about 2x on average compared with the state-of-the-art CDC approaches while still guaranteeing high deduplication ratio.
Keyword:
Boundary-Shift
content-defined chunking (CDC)
data deduplication
rolling hash
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Hybrid molecules of scutellarein and tertramethylpyrazine’s active metabolites for ischemic stroke
PREAI
分享收藏Magnetic and Structural Properties of Nanocrystalline Cobalt-Substituted Magnesium–Manganese Ferrite
PREAI
分享收藏
查看更多内容