基于V码的一种数据布局研究

Data Distribution Strategy Based on V Codes

提出一类新的双容错编码――V阵列码,冗余数据均匀分布在每个磁盘中,能容许任意两个磁盘同时故障。并证明基于V码阵列布局是最优双容错数据布局方法,给出了恢复任意两个磁盘同时故障的快速译码算法。与其他的编码方案相比,基于V码阵列布局同时具有较高的可靠性和吞吐量、较好的I/O性能、简单的编码和解码算法,以及编译码的复杂度最低和较好的平衡特性。

A class of new binary maximum distance separable （MDS） array codes called V-Code is presented. The V-Codes have a simple geometrical structure, namely, they can correct any double column erasure errors. In addition, the parity symbols are evenly distributed among all the columns, thus the bottleneck effects of repeated write operation are naturally overcome. A detailed V code＇s decoding algorithms for correcting various double node failures with a geometrical structure is provided. The complexity of encoding and decoding and the small write performance of other types of codes are compared and analyzed.