Redundant array of inexpensive disk （RAID）10 is known as the most reliable disk array architecture to tolerate up to half of total disk failures, but failure of two disks in the same mirror set still results in data...Redundant array of inexpensive disk （RAID）10 is known as the most reliable disk array architecture to tolerate up to half of total disk failures, but failure of two disks in the same mirror set still results in data loss. In this paper, we propose a new disk array architecture, mirroring and parity protected RAID （MP-RAID）, which combines both mirroring and parity techniques to further improve reliability of disk arrays. The main idea behind MP-RAID is to protect the data by both mirroring and parity techniques： keep two copies of data in the same mirror set and update the parity block in the log disk within the same parity groups. Reliability analysis shows that the reliability of MP-RAID, in terms of mean time to data loss （MTTDL）, is much better than RAID10 and RAID5.展开更多
The desire to speed up secondary storage systems has lead to the development of redundant arrays of independent disks （RAID） which incorporate redundancy utilizing erasure codes. A ＇cluttered ordering＇ is utilized...The desire to speed up secondary storage systems has lead to the development of redundant arrays of independent disks （RAID） which incorporate redundancy utilizing erasure codes. A ＇cluttered ordering＇ is utilized for designing an effective writing order to a RAID system. Cohen, Colboum and Froncek （2001） gave a cyclic construction of cluttered orderings for the complete graph by utilizing the notion of a ＇wrapped p-labelling＇. Since wrapped p-labellings as cluttered orderings for the complete graph look such as ladders, they are also called as ladder orderings. Cohen and Colboum （2004） gave a characteristic of ladder orderings. In this paper, we give an algorithm in order to generate ladder orderings.展开更多
基于单容错编码的数据布局已经不能满足存储系统对可靠性越来越高的要求,而现有的基于多容错编码的数据布局普遍存在编码解码复杂,计算负载大等缺点。文中设计了一种基于双奇偶校验的双容错数据布局DP-RA ID。该布局只需要在磁盘数量为...基于单容错编码的数据布局已经不能满足存储系统对可靠性越来越高的要求,而现有的基于多容错编码的数据布局普遍存在编码解码复杂,计算负载大等缺点。文中设计了一种基于双奇偶校验的双容错数据布局DP-RA ID。该布局只需要在磁盘数量为素数的RA ID 5阵列系统中增加1个校验磁盘,通过水平和对角方向的双重奇偶校验实现双容错。该布局的双重校验条纹长度相同,结构简单,易于实现。而且该布局的编码解码算法简单,计算负载小。研究表明该布局与RA ID 5相比,写操作性能会有少许的下降,读操作性能不变,而可靠性大幅度提高。展开更多
基金Project supported by the National Basic Research Program of China (Grant No.2004CB318201)the National High-Technology Research and Development Program of China (Grant No.2008AA01A401)the Changjiang Innovative Group of Ministry of Education of China (Grant No.IRT0725)
文摘Redundant array of inexpensive disk （RAID）10 is known as the most reliable disk array architecture to tolerate up to half of total disk failures, but failure of two disks in the same mirror set still results in data loss. In this paper, we propose a new disk array architecture, mirroring and parity protected RAID （MP-RAID）, which combines both mirroring and parity techniques to further improve reliability of disk arrays. The main idea behind MP-RAID is to protect the data by both mirroring and parity techniques： keep two copies of data in the same mirror set and update the parity block in the log disk within the same parity groups. Reliability analysis shows that the reliability of MP-RAID, in terms of mean time to data loss （MTTDL）, is much better than RAID10 and RAID5.
文摘The desire to speed up secondary storage systems has lead to the development of redundant arrays of independent disks （RAID） which incorporate redundancy utilizing erasure codes. A ＇cluttered ordering＇ is utilized for designing an effective writing order to a RAID system. Cohen, Colboum and Froncek （2001） gave a cyclic construction of cluttered orderings for the complete graph by utilizing the notion of a ＇wrapped p-labelling＇. Since wrapped p-labellings as cluttered orderings for the complete graph look such as ladders, they are also called as ladder orderings. Cohen and Colboum （2004） gave a characteristic of ladder orderings. In this paper, we give an algorithm in order to generate ladder orderings.
文摘基于单容错编码的数据布局已经不能满足存储系统对可靠性越来越高的要求,而现有的基于多容错编码的数据布局普遍存在编码解码复杂,计算负载大等缺点。文中设计了一种基于双奇偶校验的双容错数据布局DP-RA ID。该布局只需要在磁盘数量为素数的RA ID 5阵列系统中增加1个校验磁盘,通过水平和对角方向的双重奇偶校验实现双容错。该布局的双重校验条纹长度相同,结构简单,易于实现。而且该布局的编码解码算法简单,计算负载小。研究表明该布局与RA ID 5相比,写操作性能会有少许的下降,读操作性能不变,而可靠性大幅度提高。
