.png){kind=icon}
.png){kind=icon}
Return
Vectorized Sequence-Based Chunking for Data Deduplication
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2026.3660793.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Data deduplication has gained wide acclaim as a mechanism to improve storage efficiency and conserve network bandwidth. Its most critical phase, data chunking, is responsible for the overall space savings achieved via the deduplication process. However, modern data chunking algorithms are slow and compute-intensive because they scan large amounts of data while simultaneously making data-driven boundary decisions. We present SeqCDC, a novel chunking algorithm that leverages lightweight boundary detection, content-defined skipping, and SSE/AVX acceleration to improve chunking throughput for large chunk sizes. Our evaluation shows that SeqCDC achieves $15\times$ higher throughput than unaccelerated and $1.2\times$–$1.35\times$ higher throughput than vector-accelerated data chunking algorithms while minimally affecting deduplication space savings.
Keywords:
Data storage
data deduplication
SIMD
cloud computing
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W