刘军, 刘璟. 容许多个磁盘故障的RAID编码方法研究[J]. 微电子学与计算机, 2011, 28(8): 9-11.
引用本文: 刘军, 刘璟. 容许多个磁盘故障的RAID编码方法研究[J]. 微电子学与计算机, 2011, 28(8): 9-11.
shu
LIU Jun, LIU Jing. Research on RAID Coding Schemes for Tolerating Multiple Disk Failures[J]. Microelectronics & Computer, 2011, 28(8): 9-11.
Citation: LIU Jun, LIU Jing. Research on RAID Coding Schemes for Tolerating Multiple Disk Failures[J]. Microelectronics & Computer, 2011, 28(8): 9-11.
shu

容许多个磁盘故障的RAID编码方法研究

Research on RAID Coding Schemes for Tolerating Multiple Disk Failures

    摘要
  • 摘要: 随着磁盘阵列规模的增大,同时发生多个磁盘故障的概率将大大增加,单容错编码难以满足应用对高可靠性存储的需求.分析了主要的双容错RAID编码方法及其特点,对各种双容错编码方法的冗余性能进行了比较.给出了一种基于循环置换矩阵构建的能容许三个磁盘故障的MDS交换群阵列码,其编码和解码效率较高,是大规模RAID存储系统的应用方向.

     

    Abstract: As the Redundant Arrays of Inexpensive Disks(RAID) scale up,multiple disk failures are likely to take place at the same time.The single erasure code is hard to meet the requirements of high reliable storage.We reviews the coding schemes and features of various MDS array codes for tolerating up to double disk failures and compares their redundancy performances.A class of MDS Abelian group array codes for tolerating up to three disk failures is presented based on circular permutation matrices.Since the encoding and decoding are very efficient,it becomes the trend of application in large-scale RAID storage systems.

     

    • HTML全文
    • 参考文献(0)
    • 相关文章
    • 施引文献
  • 资源附件(0)

/

返回文章
返回