随机阵列码:一种高容灾易扩展的RAID存储容灾方法

发布时间：2018-07-05 17:55

  本文选题：RAID + 存储容灾　； 参考：《工程科学与技术》2017年03期

【摘要】：针对RAID存储容灾系统中数据存储的可靠性和扩展性等问题,提出一种具有较高容灾能力且易扩展的存储容灾方法,称之为随机阵列码。通过研究GF(2)上随机矩阵列满秩的性质,并将其应用在RAID存储容灾方案中。首先,依据RAID存储系统的环境配置和容灾需求设置条带参数;其次,构建相应规模且满足特定性质的随机矩阵作为编码矩阵;最后,将原始数据等分成块,利用编码矩阵将其编码并折叠存储到不同磁盘上。当发生磁盘损毁、扇区失效等原因造成数据丢失时,可依据相应的校验矩阵及剩余的编码分块进行失效数据的高概率译码恢复,从而,实现了数据高效、可靠地容灾存储。实验验证及理论分析表明:1)GF(2)上的随机高矩阵,在随机概率p=0.5,矩阵行列差δ≥15时,即具有高概率列满秩的性质;2)随机阵列码的编码参数,不再受到素数或有限域规模的限制,可灵活设置,其容灾能力也可根据容灾需求进行扩展,并可实现较多的容错模式;3)随机阵列码由于基于XOR运算,在均匀随机时与RS码、CRS码相比,具有较高的编译码速率,特别是在较大规模的编码构造中表现良好;4)随机阵列码随着规模的增长,可趋于近似MDS码,具有较高的存储空间利用率。基于随机阵列码高效,可靠,易扩展等特点,可实现一般化RAID存储容灾方案的构造,此外,也可与其他存储容灾技术结合使用,共同构建特定需求下的RAID存储容灾系统。
[Abstract]:Aiming at the problems of reliability and expansibility of data storage in raid storage disaster recovery system, a storage disaster recovery method with high disaster tolerance capability and easy expansion is proposed, which is called random array code. By studying the property of full rank of random matrix on GF (2), we apply it to raid storage and disaster recovery scheme. Firstly, according to the environment configuration and disaster tolerance requirements of raid storage system, the strip parameters are set up; secondly, the random matrix with corresponding scale and satisfying certain properties is constructed as the coding matrix; finally, the raw data is divided into blocks. The encoding matrix is used to code and fold it to different disks. When the data is lost due to the damage of the disk and the failure of the sector, the high probability decoding and recovery of the failure data can be carried out according to the corresponding check matrix and the remaining coding blocks, so that the data can be stored efficiently and reliably. Experimental verification and theoretical analysis show that the encoding parameters of random high matrix on 1: 1) GF (2) are no longer restricted by prime number or finite field size in random probability p0. 5, matrix row difference 未 鈮，

本文编号：2101172