{"title":"有效的奇偶放置方案,可以在RAID架构中容忍三重磁盘故障","authors":"Chih-Shing Tau, Tzone-I Wang","doi":"10.1109/AINA.2003.1192855","DOIUrl":null,"url":null,"abstract":"This paper proposes two improved triple parity placement schemes, the HDD1 (horizontal and dual diagonal) and HDD2 schemes, to enhance the reliability of a RAID system. Both schemes can tolerate up to three disk failures by using three types of parity information (horizontal, diagonal, and anti-diagonal parities) in RAID disk block partitions. The HDD1 scheme can reduce the occurrences of bottlenecks because its horizontal and anti-diagonal parities are uniformly distributed over a disk array, while diagonal parities are placed in a dedicated disk. The HDD2 scheme uses one more disk than HDD1 to store the horizontal parities and an additional diagonal parity, while the anti-diagonal and the diagonal parities are placed in the same way as in the HDD1 scheme, only with a minor difference. The encoding and decoding algorithms of both schemes are simple and effective. Many of the steps of the encoding and decoding algorithms can be executed in parallel. Both schemes enable a RAID to recover rapidly from up to three disk failures, with a single algorithm applied straightforwardly.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"Efficient parity placement schemes for tolerating triple disk failures in RAID architectures\",\"authors\":\"Chih-Shing Tau, Tzone-I Wang\",\"doi\":\"10.1109/AINA.2003.1192855\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes two improved triple parity placement schemes, the HDD1 (horizontal and dual diagonal) and HDD2 schemes, to enhance the reliability of a RAID system. Both schemes can tolerate up to three disk failures by using three types of parity information (horizontal, diagonal, and anti-diagonal parities) in RAID disk block partitions. The HDD1 scheme can reduce the occurrences of bottlenecks because its horizontal and anti-diagonal parities are uniformly distributed over a disk array, while diagonal parities are placed in a dedicated disk. The HDD2 scheme uses one more disk than HDD1 to store the horizontal parities and an additional diagonal parity, while the anti-diagonal and the diagonal parities are placed in the same way as in the HDD1 scheme, only with a minor difference. The encoding and decoding algorithms of both schemes are simple and effective. Many of the steps of the encoding and decoding algorithms can be executed in parallel. Both schemes enable a RAID to recover rapidly from up to three disk failures, with a single algorithm applied straightforwardly.\",\"PeriodicalId\":382765,\"journal\":{\"name\":\"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.\",\"volume\":\"65 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AINA.2003.1192855\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2003.1192855","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient parity placement schemes for tolerating triple disk failures in RAID architectures
This paper proposes two improved triple parity placement schemes, the HDD1 (horizontal and dual diagonal) and HDD2 schemes, to enhance the reliability of a RAID system. Both schemes can tolerate up to three disk failures by using three types of parity information (horizontal, diagonal, and anti-diagonal parities) in RAID disk block partitions. The HDD1 scheme can reduce the occurrences of bottlenecks because its horizontal and anti-diagonal parities are uniformly distributed over a disk array, while diagonal parities are placed in a dedicated disk. The HDD2 scheme uses one more disk than HDD1 to store the horizontal parities and an additional diagonal parity, while the anti-diagonal and the diagonal parities are placed in the same way as in the HDD1 scheme, only with a minor difference. The encoding and decoding algorithms of both schemes are simple and effective. Many of the steps of the encoding and decoding algorithms can be executed in parallel. Both schemes enable a RAID to recover rapidly from up to three disk failures, with a single algorithm applied straightforwardly.