Limited preemptive scheduling of mixed time-triggered and event-triggered tasks

M. V. D. Heuvel, R. J. Bril, Xiaodi Zhang, Jakaria Abdullah, D. Isovic
{"title":"Limited preemptive scheduling of mixed time-triggered and event-triggered tasks","authors":"M. V. D. Heuvel, R. J. Bril, Xiaodi Zhang, Jakaria Abdullah, D. Isovic","doi":"10.1109/ETFA.2013.6648046","DOIUrl":null,"url":null,"abstract":"Many embedded systems have complex timing constraints and, at the same time, have flexibility requirements which prohibit offline planning of the entire system. To support a mixture of time-triggered and event-triggered tasks, some industrial systems deploy a table-driven dispatcher for time-triggered tasks complemented with a preemptive scheduler to allocate the free time slots to event-driven tasks. Contrary to fully preemptive scheduling, limiting the preemptions of tasks to fixed preemptions points may reduce memory requirements and it alleviates the preemption costs in the system. We revisit slotshifting, which at run time mixes time-triggered and event-triggered tasks in a preemptive EDF schedule. In this paper, we extend slotshifting with limited-preemptive execution of event-triggered tasks. We present a synchronization protocol to arbitrate the executions of non-preemptive regions, so that time-triggered tasks keep meeting their timing constraints implicitly. Furthermore, we investigate how to disable preemptions of event-triggered tasks during the execution of the offline-scheduled time-triggered tasks, while keeping the feature of slotshifting to reallocate their slots of execution dynamically at run time.","PeriodicalId":106678,"journal":{"name":"2013 IEEE 18th Conference on Emerging Technologies & Factory Automation (ETFA)","volume":"24 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 18th Conference on Emerging Technologies & Factory Automation (ETFA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ETFA.2013.6648046","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Many embedded systems have complex timing constraints and, at the same time, have flexibility requirements which prohibit offline planning of the entire system. To support a mixture of time-triggered and event-triggered tasks, some industrial systems deploy a table-driven dispatcher for time-triggered tasks complemented with a preemptive scheduler to allocate the free time slots to event-driven tasks. Contrary to fully preemptive scheduling, limiting the preemptions of tasks to fixed preemptions points may reduce memory requirements and it alleviates the preemption costs in the system. We revisit slotshifting, which at run time mixes time-triggered and event-triggered tasks in a preemptive EDF schedule. In this paper, we extend slotshifting with limited-preemptive execution of event-triggered tasks. We present a synchronization protocol to arbitrate the executions of non-preemptive regions, so that time-triggered tasks keep meeting their timing constraints implicitly. Furthermore, we investigate how to disable preemptions of event-triggered tasks during the execution of the offline-scheduled time-triggered tasks, while keeping the feature of slotshifting to reallocate their slots of execution dynamically at run time.
时间触发和事件触发混合任务的有限抢占调度
许多嵌入式系统具有复杂的时间约束,同时具有灵活性要求,这禁止对整个系统进行离线规划。为了支持时间触发任务和事件触发任务的混合,一些工业系统为时间触发任务部署了一个表驱动的调度程序,并辅以一个抢占式调度器,将空闲时间段分配给事件驱动任务。与完全抢占调度相反,将任务的抢占限制在固定的抢占点上,可以减少内存需求,减轻系统的抢占成本。我们重新讨论槽位移位,它在运行时将时间触发的任务和事件触发的任务混合在一个抢占式EDF调度中。在本文中,我们用事件触发任务的有限抢占执行来扩展槽移。我们提出了一种同步协议来仲裁非抢占区域的执行,从而使时间触发的任务隐式地满足其时间约束。此外,我们还研究了如何在离线调度的时间触发任务执行期间禁用事件触发任务的抢占,同时保持槽位移动的特性,以便在运行时动态重新分配其执行槽位。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信