Speeding up reconstruction of declustered RAID with special mapping

Svetlana Lazareva, G. Petrunin
{"title":"Speeding up reconstruction of declustered RAID with special mapping","authors":"Svetlana Lazareva, G. Petrunin","doi":"10.1145/3579370.3594761","DOIUrl":null,"url":null,"abstract":"It is known that ZFS dRAID [2] provides random data blocks permutation and reconstruction speed up is getting its boost with this initial condition. The question we tried to answer is if there some special permutation that would optimize reconstruction speed at theoretical maximum. We introduce our solution with the usage of cyclic matrices of data layout as currently the best found way to get maximum benefit out from initial declustered RAID configuration.","PeriodicalId":180024,"journal":{"name":"Proceedings of the 16th ACM International Conference on Systems and Storage","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 16th ACM International Conference on Systems and Storage","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3579370.3594761","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

It is known that ZFS dRAID [2] provides random data blocks permutation and reconstruction speed up is getting its boost with this initial condition. The question we tried to answer is if there some special permutation that would optimize reconstruction speed at theoretical maximum. We introduce our solution with the usage of cyclic matrices of data layout as currently the best found way to get maximum benefit out from initial declustered RAID configuration.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
加速特殊映射的集群RAID重构
众所周知,ZFS dRAID[2]提供随机数据块排列和重构,在这个初始条件下,加速得到了提升。我们试图回答的问题是,是否存在某种特殊的排列,可以使重建速度达到理论最大值。我们通过使用数据布局的循环矩阵来介绍我们的解决方案,这是目前从初始集群RAID配置中获得最大收益的最佳方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Next-Generation Security Entity Linkage: Harnessing the Power of Knowledge Graphs and Large Language F3: Serving Files Efficiently in Serverless Computing Speeding up reconstruction of declustered RAID with special mapping Analyzing large-scale genomic data with cloud data lakes Fuzzing LibraryOSes for Iago vulnerabilities
×
引用
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