Stride Static Chunking Algorithm for Deduplication System
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we propose a stride static chunking deduplication algorithm using a hybrid approach that exploits the advantages of static chunking and byte-shift chunking algorithm. The key contribution of our approach is to reduce the computation time and enhance deduplication performance. We assume that duplicated data blocks are generally gathered into groups; thus, if we find one duplicated data block using byte-shift, then we can find subsequent data blocks with the static chunking approach. Experimental results show that stride static chunking algorithm gives significant benefits over static chunking, byte-shift chunking and variable-length chunking algorithm, particularly for reducing processing time and storage space.
著者
-
Yoo Chuck
Department Of Computer Science And Engineering Korea University
-
KO Young-Woong
Department of Computer Engineering, Hallym University
-
JUNG Ho-Min
Department of Computer Engineering, Hallym University
-
LEE Wan-Yeon
Department of Computer Science, Dongduk Womens University
-
KIM Min-Ja
Department of Computer Science and Engineering, Korea University
関連論文
- Momentary Recovery Algorithm : A New Look at the Traditional Problem of TCP
- FAMH : Fast Inter-Subnet Multicast Handoff Method for IEEE 802.11 WLANs(Network)
- Shared Page Table : Sharing of Virtual Memory Resources(Regular Section)
- Cache-Aware Virtual Machine Scheduling on Multi-Core Architecture
- Stride Static Chunking Algorithm for Deduplication System
- Synchronization-Aware Virtual Machine Scheduling for Parallel Applications in Xen