J4 ›› 2013, Vol. 35 ›› Issue (5): 20-27.
• 论文 • Previous Articles Next Articles
YAN Lin1,2,XING Jing1,HUO Zhigang1,MA Jie1
Received:
Revised:
Online:
Published:
Abstract:
As the rapid growing of massive data, the storage method of cluster file system is developing from replication to Erasure Code. The storage system based on Erasure Code can provide higher reliability with less storage overhead. However, in the procedure of storing original data and the coded data, storage based on Erasure Code faces more disk I/O conflicts and unbalanced load, which jeopardizes the throughput of the system. Specially, there is a tradeoff between data consistency and data caching in the storage system based on Erasure Code when writing back the parity. And there are limitations for the use of non-datacaching machanism and alldatacaching machanism in the cluster file system. For these two issues, the paper proposed an I/O optimization method, which includes the data layout machanism balancing the load and the parity consistency machanism. In the cluster file system ECFS we developed base on Erasure Code, the throughput of the system can be improved by 95.53% after exploiting the I/O optimization.
Key words: cluster file system;massive storage;erasurecode;data placement;parity caching;consistency
YAN Lin1,2,XING Jing1,HUO Zhigang1,MA Jie1. I/O optimization in ErasureCode distributed file system for massive data storage[J]. J4, 2013, 35(5): 20-27.
Add to citation manager EndNote|Ris|BibTeX
URL: http://joces.nudt.edu.cn/EN/
http://joces.nudt.edu.cn/EN/Y2013/V35/I5/20