A mixed locking/abort protocol for hard real-time systems

Lih-Chyun Shu, M. Young
{"title":"A mixed locking/abort protocol for hard real-time systems","authors":"Lih-Chyun Shu, M. Young","doi":"10.1109/RTOSS.1994.292552","DOIUrl":null,"url":null,"abstract":"Serializability greatly simplifies reasoning about correctness in concurrent systems, including real-time systems. Our research addresses concurrency control protocols that accommodate analytic guarantees of schedulability, can be implemented with small bounded overheads and blocking, and ensure serializable execution of entire tasks including complete read/compute/write cycles (as opposed to serializable execution only of short embedded transactions without computation.) One such protocol which combines locking and abort is described. Among its interesting properties are that transactions scheduled by locking are never aborted, tasks are aborted only due to conflict with higher priority tasks, and the cost of abortion can be bounded for the purpose of schedulability analysis. The protocol is illustrated with an avionics example. The priority ceiling protocol can ensure schedulability of 8 tasks if serializability of only short sequences of data accesses is required, but cannot schedule even the first 2 tasks if serializability is required for whole tasks. Under reasonable assumptions our protocol achieves schedulability of the first 6 tasks while guaranteeing serializability of entire tasks.<<ETX>>","PeriodicalId":103713,"journal":{"name":"Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTOSS.1994.292552","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

Abstract

Serializability greatly simplifies reasoning about correctness in concurrent systems, including real-time systems. Our research addresses concurrency control protocols that accommodate analytic guarantees of schedulability, can be implemented with small bounded overheads and blocking, and ensure serializable execution of entire tasks including complete read/compute/write cycles (as opposed to serializable execution only of short embedded transactions without computation.) One such protocol which combines locking and abort is described. Among its interesting properties are that transactions scheduled by locking are never aborted, tasks are aborted only due to conflict with higher priority tasks, and the cost of abortion can be bounded for the purpose of schedulability analysis. The protocol is illustrated with an avionics example. The priority ceiling protocol can ensure schedulability of 8 tasks if serializability of only short sequences of data accesses is required, but cannot schedule even the first 2 tasks if serializability is required for whole tasks. Under reasonable assumptions our protocol achieves schedulability of the first 6 tasks while guaranteeing serializability of entire tasks.<>
一种用于硬实时系统的混合锁定/中止协议
可序列化性极大地简化了并发系统(包括实时系统)中关于正确性的推理。我们的研究解决了并发控制协议,以适应可调度性的分析保证,可以实现小的有限开销和阻塞,并确保整个任务的串行化执行,包括完整的读/计算/写周期(与串行化执行相反,只有短的嵌入式事务没有计算)。描述了一种这样的协议,它结合了锁定和中止。其有趣的特性之一是,通过锁定调度的事务永远不会中止,任务只有在与更高优先级的任务发生冲突时才会中止,而且中止的成本可以为可调度性分析的目的而限定。通过一个航电实例对该协议进行了说明。如果只需要短序列数据访问的可序列化性,优先级上限协议可以确保8个任务的可调度性,但如果需要整个任务的可序列化性,则连前2个任务都无法调度。在合理的假设下,我们的协议实现了前6个任务的可调度性,同时保证了整个任务的可序列化性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信