一种新的三容错最大距离可分阵列码  

A New Maximum Distance Separable Array Code on Toleration Triple Failures

作　　者：万武南[1] 索望[1] 王拓[1] 杨威[1] 

机构地区：[1]成都信息工程学院网络工程学院,成都610225

出　　处：《小型微型计算机系统》2013年第10期2267-2271,共5页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60873216)资助;四川省教育厅重点项目(12ZA223)资助

摘　　要：随着海量存储系统的发展,双容错数据布局已不能满足系统对可靠性要求.在双容错行对角线奇偶码的基础上,只增加1冗余校验列,提出一种新的3容错最大距离可分阵列码.采用二元矩阵给出了新的阵列码代数编码定义,并通过基二元矩阵变换,给出结构简单易于软硬件实现的译码算法.并理论上证明新阵列码具有最大距离可分编码特性,空间利用率达到了3容错编码最优.与现有其它3容错编码进行比较,分析结果表明新码的编译码效率,小写性能,以及平衡性的综合性能达到最优.With the development of massive storage system, the data placements base on toleration double failures can not meet the re- quirement of the reliability in storage systems. On the basis of the Row Diagonal Parity code for double toleration failures, a new class of Maximum Distance Separable array codes for triple failures is presented by adding a redundancy parity column. The algo- rithms of decoding are directly depicted by binary matrix transformation, and more easily implemented by software and hardware for simple structure. The Maximum Distance Separable property is theoretically proven. It is optimal in storage efficiency among triple e- rasure-correcting codes. The theoretical analysis shows that the comprehensive properties of the proposed code are better than other popular MDS codes, such as encoding and decoding efficiency, small writes and balance performance.

关 键 词：编码 纠删码 RDP码 数据容错 分布式存储 

分 类 号：TP333[自动化与计算机技术—计算机系统结构]