计算机科学 ›› 2011, Vol. 38 ›› Issue (3): 304-307.

• 体系结构 • 上一篇    

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

杜建军,李华,陈明   

  1. (重庆大学计算机学院 重庆400030)
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受国家科技支撑计划:可信任互联网(2008BAH37B04)资助。

P-code Analyzing Based on BDM Model and Extension Research

DU Jian-jun,LI Hua,CHEN Ming   

  • Online:2018-11-16 Published:2018-11-16

摘要: 以磁盘冗余阵列(Redundant Array of Inexpensive Disks, RAID)技术中新出现的Pcode编码为主要对象,进行了其构造方法、编码及译码算法的详细分析,并首次运用位矩阵(Binary Distribution Matrix, I3DM)的方法分析和研究了P-code码。在此基础上,对当前主要RAII}6编码的扩展即更多磁盘数量的容错问题进行了总结与探讨,提出了P-code等垂直最大距离可分码(Maximum Distance Separable, MDS)的扩展将是该领域未来研究的新方向和难点。

关键词: RAID-6 , P-cock编码,位矩阵,编码扩展

Abstract: 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 RAIL〕6 extension for tolerating more than three disks failure was concluded. Including P-code, the research of vertical RAIL)6 extension of Maximum Distance Separable (MDS) codes should be a new study direction and a difficult research problem in this domain.

Key words: RAID-6 , P-code, Binary distribution matrix, Coding extension

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!