Multiprocessor Real-Time Locking Protocols for Replicated Resources

Catherine E. Nemitz, Kecheng Yang, Ming Yang, Pontus Ekberg, James H. Anderson
{"title":"Multiprocessor Real-Time Locking Protocols for Replicated Resources","authors":"Catherine E. Nemitz, Kecheng Yang, Ming Yang, Pontus Ekberg, James H. Anderson","doi":"10.1109/ECRTS.2016.29","DOIUrl":null,"url":null,"abstract":"A real-time multiprocessor synchronization problem is studied herein that has not be extensively studied before, namely, the management of replicated resources where tasks may require multiple replicas to execute. In prior work on replicated resources, k-exclusion locks have been used, but this restricts tasks to lock only one replica at a time. To motivate the need for unrestricted replica sharing, two use cases are discussed that reveal an interesting tradeoff: in one of the use cases, blocking is the dominant lock-related factor impacting schedulability, while in the other, lock/unlock overheads are. Motivated by these use cases, three replica-allocation protocols are presented. In the first two, the lock/unlock logic is very simple, yielding low overheads, but blocking is not optimal. In the third, blocking is optimal (ignoring constant factors), but additional lock/unlock overhead is incurred to properly order lock requests. Experiments are presented that examine the overhead/blocking tradeoff motivated by these protocols in some detail.","PeriodicalId":178974,"journal":{"name":"2016 28th Euromicro Conference on Real-Time Systems (ECRTS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 28th Euromicro Conference on Real-Time Systems (ECRTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECRTS.2016.29","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

A real-time multiprocessor synchronization problem is studied herein that has not be extensively studied before, namely, the management of replicated resources where tasks may require multiple replicas to execute. In prior work on replicated resources, k-exclusion locks have been used, but this restricts tasks to lock only one replica at a time. To motivate the need for unrestricted replica sharing, two use cases are discussed that reveal an interesting tradeoff: in one of the use cases, blocking is the dominant lock-related factor impacting schedulability, while in the other, lock/unlock overheads are. Motivated by these use cases, three replica-allocation protocols are presented. In the first two, the lock/unlock logic is very simple, yielding low overheads, but blocking is not optimal. In the third, blocking is optimal (ignoring constant factors), but additional lock/unlock overhead is incurred to properly order lock requests. Experiments are presented that examine the overhead/blocking tradeoff motivated by these protocols in some detail.
复制资源的多处理器实时锁定协议
本文研究了一个以前没有广泛研究过的实时多处理器同步问题,即任务可能需要多个副本来执行的复制资源的管理。在之前对复制资源的工作中,已经使用了k-exclusion锁,但这限制了任务一次只能锁定一个副本。为了激发对无限制副本共享的需求,我们讨论了两个用例,它们揭示了一个有趣的权衡:在其中一个用例中,阻塞是影响可调度性的主要锁相关因素,而在另一个用例中,锁/解锁开销是影响可调度性的主要因素。在这些用例的推动下,提出了三种副本分配协议。在前两种情况下,锁/解锁逻辑非常简单,开销很低,但是阻塞不是最优的。在第三种情况下,阻塞是最优的(忽略常量因素),但是为了正确排序锁请求,会产生额外的锁/解锁开销。提出了一些实验,详细检查了这些协议引起的开销/阻塞权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信