Almost complete address translation (ACATS) disk array declustering

J. Thomas, S. J. Schwarz, W. Burkhard
{"title":"Almost complete address translation (ACATS) disk array declustering","authors":"J. Thomas, S. J. Schwarz, W. Burkhard","doi":"10.1109/SPDP.1996.570350","DOIUrl":null,"url":null,"abstract":"We present a novel declustering scheme (ACATS) for reliability stripes in an orthogonal disk array. Our scheme is deterministic, run-time efficient and provides frequently the best possible and always an almost best possible distribution of failure-induced incremental rebuild workloads. Our scheme provides protection against single disk as well as single string failures within the disk array. Our approach presents a framework in which the Level 5 RAID organization logically appears as a Level 4 RAID; it facilitates the provision of distributed sparing in exactly the same manner ACATS does not require the existence of a suitably configured block design or of a run-time efficient pseudo-random number generator; it is applicable to arbitrarily configured orthogonal disk arrays. Our scheme is faster than declustering schemes that use pseudo-random permutations and achieves better uniformity of disk loads during a disk rebuild; it is simpler than schemes based on block designs. ACATS provides a rich spectrum of declustering schemes.","PeriodicalId":360478,"journal":{"name":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","volume":"314 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPDP.1996.570350","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

We present a novel declustering scheme (ACATS) for reliability stripes in an orthogonal disk array. Our scheme is deterministic, run-time efficient and provides frequently the best possible and always an almost best possible distribution of failure-induced incremental rebuild workloads. Our scheme provides protection against single disk as well as single string failures within the disk array. Our approach presents a framework in which the Level 5 RAID organization logically appears as a Level 4 RAID; it facilitates the provision of distributed sparing in exactly the same manner ACATS does not require the existence of a suitably configured block design or of a run-time efficient pseudo-random number generator; it is applicable to arbitrarily configured orthogonal disk arrays. Our scheme is faster than declustering schemes that use pseudo-random permutations and achieves better uniformity of disk loads during a disk rebuild; it is simpler than schemes based on block designs. ACATS provides a rich spectrum of declustering schemes.
几乎完全地址转换(ACATS)磁盘阵列集群
提出了一种新的正交磁盘阵列可靠性条纹的聚类方案。我们的方案是确定的,运行时高效的,并且经常提供最好的,并且总是提供几乎最好的,由故障引起的增量重建工作负载的分布。我们的方案提供了针对磁盘阵列内单个磁盘和单个字符串故障的保护。我们的方法提出了一个框架,其中5级RAID组织在逻辑上表现为4级RAID;它有助于以完全相同的方式提供分布式节约,ACATS不需要存在适当配置的块设计或运行时高效的伪随机数生成器;适用于任意配置的正交磁盘阵列。我们的方案比使用伪随机排列的散簇方案更快,并且在磁盘重建期间实现了更好的磁盘负载均匀性;它比基于块设计的方案更简单。ACATS提供了丰富的集群方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信