有效的奇偶放置方案,可以在RAID架构中容忍三重磁盘故障

Chih-Shing Tau, Tzone-I Wang
{"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}
引用次数: 20

摘要

为了提高RAID系统的可靠性,本文提出了两种改进的三重奇偶放置方案:HDD1(水平和双对角线)和HDD2方案。通过在RAID磁盘块分区中使用三种类型的奇偶校验信息(水平、对角和反对角奇偶),这两种方案最多可以容忍三次磁盘故障。HDD1方案可以减少瓶颈的出现,因为它的水平和反对角偶对在磁盘阵列上均匀分布,而对角偶对则放在专用磁盘中。HDD2方案比HDD1多使用一个磁盘来存储水平奇偶校验和一个额外的对角线奇偶校验,而反对角线和对角线奇偶校验的放置方式与HDD1方案相同,只有很小的不同。两种方案的编解码算法都简单有效。编码和解码算法的许多步骤可以并行执行。这两种方案都使RAID能够从最多三个磁盘故障中快速恢复,只需直接应用一个算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An efficient optimal algorithm for virtual path bandwidth allocation RIDEE: a realtime and interactive distance education support system Detection of multiple bottleneck bandwidth Update operation and partition dependency in distributed database systems A proposal of a multi-agent supporting system for network community formation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1