A Novel Cache Prefetching Algorithm for Restoration Operations of Deduplication Systems

摘要

Sharing data chunks and sequentially writing data chunks result in data fragments in deduplication systems, which may degrade the reading throughput of these systems. To improve the reading throughput of deduplication systems, we propose a novel cache prefetching algorithm, referred to as WSP, which can detect weak sequential reading in the read requests of restoration operations and prefetch data for them, unlike the traditional cache prefetching algorithm, which cannot. Experimental results show that, when the cache size is 256 MB, the average cache miss rate of WSP is 77.5 % of that of the traditional cache prefetching algorithm for all 21 workloads.