Atomic recovery units: failure atomicity for logical disks

R. Grimm, Wilson C. Hsieh, W. D. Jonge, M. Kaashoek
{"title":"Atomic recovery units: failure atomicity for logical disks","authors":"R. Grimm, Wilson C. Hsieh, W. D. Jonge, M. Kaashoek","doi":"10.1109/ICDCS.1996.507898","DOIUrl":null,"url":null,"abstract":"Atomic recovery units (ARUs) are a mechanism that allows several logical disk operations to be executed as a single atomic unit with respect to failures. For example, ARUs can be used during file creation to update several pieces of file meta-data atomically. ARUs simplify systems, as they isolate issues of atomicity within the logical disk system, ARUs are designed as part of the Logical Disk (LD), which provides an interface to disk storage that separates file and disk management by using logical block numbers and block lists. This paper discusses the semantics of concurrent ARUs, as well as the concurrency control they require. A prototype implementation in a log-structured logical disk system is presented and evaluated. The performance evaluation shows that the run-time overhead to support concurrent ARUs is negligible for Read and Write operations, and small but pronounced for file creation (4.0%-7.2%) and deletion (17.9%-20.5%) which mainly manipulate meta-data. The low overhead (when averaged over file creation, writing, reading, and deletion) for concurrent ARUs shows that issues of atomicity can be successfully isolated within the disk system.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"133 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 16th International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.1996.507898","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

Abstract

Atomic recovery units (ARUs) are a mechanism that allows several logical disk operations to be executed as a single atomic unit with respect to failures. For example, ARUs can be used during file creation to update several pieces of file meta-data atomically. ARUs simplify systems, as they isolate issues of atomicity within the logical disk system, ARUs are designed as part of the Logical Disk (LD), which provides an interface to disk storage that separates file and disk management by using logical block numbers and block lists. This paper discusses the semantics of concurrent ARUs, as well as the concurrency control they require. A prototype implementation in a log-structured logical disk system is presented and evaluated. The performance evaluation shows that the run-time overhead to support concurrent ARUs is negligible for Read and Write operations, and small but pronounced for file creation (4.0%-7.2%) and deletion (17.9%-20.5%) which mainly manipulate meta-data. The low overhead (when averaged over file creation, writing, reading, and deletion) for concurrent ARUs shows that issues of atomicity can be successfully isolated within the disk system.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
原子恢复单元:逻辑盘的故障原子性
原子恢复单元(ARUs)是一种机制,它允许多个逻辑磁盘操作作为单个原子单元执行,以应对故障。例如,可以在文件创建期间使用ARUs自动更新文件元数据的几个片段。aro简化了系统,因为它们隔离了逻辑磁盘系统中的原子性问题,aro被设计为逻辑磁盘(LD)的一部分,LD提供了一个磁盘存储接口,通过使用逻辑块编号和块列表分离文件和磁盘管理。本文讨论了并发ARUs的语义,以及它们所需要的并发控制。提出并评价了日志结构逻辑磁盘系统的原型实现。性能评估表明,支持并发ARUs的运行时开销对于读和写操作来说可以忽略不计,对于主要操作元数据的文件创建(4.0%-7.2%)和删除(17.9%-20.5%)来说很小,但明显。并发ARUs的低开销(按文件创建、写入、读取和删除的平均值计算)表明,可以在磁盘系统中成功地隔离原子性问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An extended network scheduling model Distributed priority queues on hypercube architectures An embeddable and extendable language for large-scale programming on the Internet Conservative garbage collection on distributed shared memory systems Optimal deadlock detection in distributed systems based on locally constructed wait-for graphs
×
引用
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