P-code位矩阵方法与扩展研究  

P-code Analyzing Based on BDM Model and Extension Research

作　　者：杜建军[1] 李华[1] 陈明[1] 

机构地区：[1]重庆大学计算机学院,重庆400030

出　　处：《计算机科学》2011年第3期304-306,F0003,共4页Computer Science

基　　金：国家科技支撑计划:可信任互联网(2008BAH37B04)资助

摘　　要：以磁盘冗余阵列(Redundant Array of Inexpensive Disks,RAID)技术中新出现的P-code编码为主要对象,进行了其构造方法、编码及译码算法的详细分析,并首次运用位矩阵(Binary Distribution Matrix,BDM)的方法分析和研究了P-code码。在此基础上,对当前主要RAID-6编码的扩展即更多磁盘数量的容错问题进行了总结与探讨,提出了P-code等垂直最大距离可分码(Maximum Distance Separable,MDS)的扩展将是该领域未来研究的新方向和难点。P-code is one new member of Redundant Array of Inexpensive Disks（RAID） coding family,and its structure,coding method and decoding algorithm were analyzed in this paper.Further more the Binary Distribution Matrix（BDM） was firstly applied in P-code study.Based on this work,the approach of RAID-6 extension for tolerating more than three disks failure was concluded.Including P-code,the research of vertical RAID-6 extension of Maximum Distance Separable（MDS） codes should be a new study direction and a difficult research problem in this domain.

关 键 词：RAID-6 p-code编码 位矩阵 编码扩展 

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