一种新的3容错扩展RAID码  

A Toleration Based Extended RAID Code Triple Failures

作　　者：万武南[1,2] 杨威[1] 陈运[2] 

机构地区：[1]成都信息工程学院信息安全工程学院,成都610225 [2]成都信息工程学院应用密码学研究所,成都610225

出　　处：《北京邮电大学学报》2014年第5期75-79,共5页Journal of Beijing University of Posts and Telecommunications

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

摘　　要：随着存储系统规模的扩大,如何提高存储系统可靠性成为一个必须解决的问题.目前的双容错独立冗余磁盘阵列(RAID)码已经无法满足存储系统可靠性要求.在双容错行对角奇偶校验(RDP)码的基础上,提出了一种编码冗余率和纠错能力达到编码最优的新的扩展RDP-RAID码,可以允许任意3磁盘同时故障,并给出了一种基于二元矩阵变换的简单和直观的译码算法.与STAT码和EEOD码相比,扩展RDP-RAID码的编译码复杂度、更新复杂度、存储效率的综合性能可达到最优,存储可靠性高.As the storage system grows, how to improve the system reliability has become a key issue to the storage system. The redundant array of independent disk （RAID） codes of tolerating double failures can not meet the requirement of reliability in storage system. On the basis of the row diagonal parity （RDP） code for double toleration failures, a new class of extended RDP-RAID code for triple storage failures was presented. The three nodes failure recovery capability for a given data redundancy were opti- mal. The simple and intuitive algorithms of encoding and decoding were proposed by using binary matrix transformation. Analysis shows that the comprehensive properties of the proposed code are better than the STAT code and the EEOD code, such as update complexity, encoding and decoding complexity, storage efficiency. And it shows high reliability for storage systems.

关 键 词：独立冗余磁盘阵列编码 阵列码 行对角奇偶校验码 纠删码 

分 类 号：TN911.22[电子电信—通信与信息系统]