arrow
返回

MUCH: Multithreaded Content-Based File Chunking

delete2015-05-01
delete14
PRE
AI
Y
Youjip Won *
K
Kyeongyeol Lim
J
Jae‐Hong Min
DOI:10.1109/TC.2014.2322600delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In this work, we developed a novel multithreaded variable size chunking method, MUCH, which exploits the multicore architecture of the modern microprocessors. The legacy single threaded variable size chunking method leaves much to be desired in terms of effectively exploiting the bandwidth of the state of the art storage devices. MUCH guarantees chunking invariability: The result of chunking does not change regardless of the degree of multithreading or the segment size. This is achieved by inter and intra-segment coalescing at the master thread and Dual Mode Chunking at the client thread. We developed an elaborate performance model to determine the optimal multithreading degree and the segment size. MUCH is implemented in the prototype deduplication system. By fully exploiting the available CPU cores (quad-core), we achieved up to x4 increase in the chunking performance (MByte/sec). MUCH successfully addresses the performance issues of file chunking which is one of the performance bottlenecks in modern deduplication systems by parallelizing the file chunking operation while guaranteeing Chunking Invariability.
Keyword:
Content-based chunking
deduplication
multithread
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Computers 封面图
IEEE Transactions on Computers
IF:
3.8
论文数:
5.4K
被引数:
9.8K

机构

H
hanyang university
学者数:
2.9W
论文数: 2.7W
被引数: 36
引用论文

引用论文

err分享
err收藏