一种基于综合重排优先级的加速RAID重构方法

Xin Xie, Chentao Wu, Chao Li, Jie Li, M. Guo, Fang Xu
{"title":"一种基于综合重排优先级的加速RAID重构方法","authors":"Xin Xie, Chentao Wu, Chao Li, Jie Li, M. Guo, Fang Xu","doi":"10.1109/SRDSW49218.2019.00010","DOIUrl":null,"url":null,"abstract":"With the development of cloud computing, the reliability of disk arrays are increasingly concerned. Data centers usually use erasure codes to provide high reliability. However, most of reconstruction methods on disk arrays focus on single/ multiple disk(s) recovery, which ignores how to efficiently reconstruct the lost data such as Latent Sector Errors (LSEs), etc. In real situations, local stripe errors are much more common than disk failures. It has become an urgent problem that how to improve reconstruction efficiently for stripes. This paper proposes a comprehensive rearranging priority reconstruction(CRPR), which combines temporal locality, spatial locality and coding characteristics together. CRPR divides different blocks into various priorities and recovers them sequentially. To demonstrate the effectiveness of CRPR, we conduct several simulations via disksim. The simulations results show that, the comprehensive rearranging priority reconstruction method keeps up with previous methods and can save up to 63.9% in terms of waiting time.","PeriodicalId":297328,"journal":{"name":"2019 38th International Symposium on Reliable Distributed Systems Workshops (SRDSW)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Comprehensive Rearranging Priority Based Method To Accelerate the Reconstruction of RAID Arrays\",\"authors\":\"Xin Xie, Chentao Wu, Chao Li, Jie Li, M. Guo, Fang Xu\",\"doi\":\"10.1109/SRDSW49218.2019.00010\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the development of cloud computing, the reliability of disk arrays are increasingly concerned. Data centers usually use erasure codes to provide high reliability. However, most of reconstruction methods on disk arrays focus on single/ multiple disk(s) recovery, which ignores how to efficiently reconstruct the lost data such as Latent Sector Errors (LSEs), etc. In real situations, local stripe errors are much more common than disk failures. It has become an urgent problem that how to improve reconstruction efficiently for stripes. This paper proposes a comprehensive rearranging priority reconstruction(CRPR), which combines temporal locality, spatial locality and coding characteristics together. CRPR divides different blocks into various priorities and recovers them sequentially. To demonstrate the effectiveness of CRPR, we conduct several simulations via disksim. The simulations results show that, the comprehensive rearranging priority reconstruction method keeps up with previous methods and can save up to 63.9% in terms of waiting time.\",\"PeriodicalId\":297328,\"journal\":{\"name\":\"2019 38th International Symposium on Reliable Distributed Systems Workshops (SRDSW)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 38th International Symposium on Reliable Distributed Systems Workshops (SRDSW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SRDSW49218.2019.00010\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 38th International Symposium on Reliable Distributed Systems Workshops (SRDSW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SRDSW49218.2019.00010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着云计算的发展,磁盘阵列的可靠性越来越受到人们的关注。数据中心通常使用擦除码来提供高可靠性。然而,大多数磁盘阵列的重构方法都集中在单盘/多盘恢复上,而忽略了如何有效地重构丢失的数据,如潜在扇区错误(Latent Sector error, lse)等。在实际情况下,本地分条错误比磁盘故障更常见。如何提高条纹图像的重构效率已成为一个亟待解决的问题。提出了一种综合时间局部性、空间局部性和编码特征的重排优先级重构方法。CRPR将不同的块划分为不同的优先级,并依次恢复。为了证明CRPR的有效性,我们通过disksim进行了多次仿真。仿真结果表明,综合重排优先级重建方法与以往方法基本一致,可节省63.9%的等待时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Comprehensive Rearranging Priority Based Method To Accelerate the Reconstruction of RAID Arrays
With the development of cloud computing, the reliability of disk arrays are increasingly concerned. Data centers usually use erasure codes to provide high reliability. However, most of reconstruction methods on disk arrays focus on single/ multiple disk(s) recovery, which ignores how to efficiently reconstruct the lost data such as Latent Sector Errors (LSEs), etc. In real situations, local stripe errors are much more common than disk failures. It has become an urgent problem that how to improve reconstruction efficiently for stripes. This paper proposes a comprehensive rearranging priority reconstruction(CRPR), which combines temporal locality, spatial locality and coding characteristics together. CRPR divides different blocks into various priorities and recovers them sequentially. To demonstrate the effectiveness of CRPR, we conduct several simulations via disksim. The simulations results show that, the comprehensive rearranging priority reconstruction method keeps up with previous methods and can save up to 63.9% in terms of waiting time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Case for Dynamically Programmable Storage Background Tasks Pooled Mining is Driving Blockchains Toward Centralized Systems Evaluation and Ranking of Replica Deployments in Geographic State Machine Replication Enabling the Efficient, Dependable Cloud-Based Storage of Human Genomes On the Impact of log Compaction on Incrementally Checkpointing Stateful Stream-Processing Operators
×
引用
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