Protecting RAID Arrays against Unexpectedly High Disk Failure Rates

Jehan-Francois Pâris, T. Schwarz, A. Amer, D. Long
{"title":"Protecting RAID Arrays against Unexpectedly High Disk Failure Rates","authors":"Jehan-Francois Pâris, T. Schwarz, A. Amer, D. Long","doi":"10.1109/PRDC.2014.17","DOIUrl":null,"url":null,"abstract":"Disk failure rates vary so widely among different makes and models that designing storage solutions for the worst case scenario is a losing proposition. The approach we propose here is to design our storage solutions for the most probable case while incorporating in our design the option of adding extra redundancy when we find out that its disks are less reliable than expected. To illustrate our proposal, we show how to increase the reliability of existing two-dimensional disk arrays with n2 data elements and 2n parity elements by adding n additional parity elements that will mirror the contents of half the existing parity elements. Our approach offers the three advantages of being easy to deploy, not affecting the complexity of parity calculations, and providing a five-year reliability of 99.999 percent in the face of catastrophic levels of data loss where the array would lose up to a quarter of its storage capacity in a year.","PeriodicalId":187000,"journal":{"name":"2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRDC.2014.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Disk failure rates vary so widely among different makes and models that designing storage solutions for the worst case scenario is a losing proposition. The approach we propose here is to design our storage solutions for the most probable case while incorporating in our design the option of adding extra redundancy when we find out that its disks are less reliable than expected. To illustrate our proposal, we show how to increase the reliability of existing two-dimensional disk arrays with n2 data elements and 2n parity elements by adding n additional parity elements that will mirror the contents of half the existing parity elements. Our approach offers the three advantages of being easy to deploy, not affecting the complexity of parity calculations, and providing a five-year reliability of 99.999 percent in the face of catastrophic levels of data loss where the array would lose up to a quarter of its storage capacity in a year.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
保护RAID免受高硬盘故障率的影响
不同品牌和型号的磁盘故障率差异如此之大,以至于为最坏的情况设计存储解决方案是一个失败的主张。我们在这里提出的方法是为最可能的情况设计我们的存储解决方案,同时在我们的设计中纳入当我们发现磁盘的可靠性低于预期时添加额外冗余的选项。为了说明我们的建议,我们展示了如何通过添加n个额外的奇偶元素来提高具有n2个数据元素和2n个奇偶元素的现有二维磁盘阵列的可靠性,这些奇偶元素将镜像现有奇偶元素的一半内容。我们的方法提供了三个优点:易于部署,不影响奇偶校验计算的复杂性,并且在面对灾难性的数据丢失级别时提供99.999%的五年可靠性,其中阵列将在一年内损失多达四分之一的存储容量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Reduction of NBTI-Induced Degradation on Ring Oscillators in FPGA Region-Adherent Algorithms: Restricting the Impact of Faults on Service Quality CloudBFT: Elastic Byzantine Fault Tolerance Reliable Shortest Paths in Wireless Sensor Networks: Refocusing on Link Failure Scenarios from Applications Responsiveness of Service Discovery in Wireless Mesh Networks
×
引用
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