On Fixed-Priority Schedulability Analysis of Sporadic Tasks with Self-Suspension

M. Mohaqeqi, Pontus Ekberg, W. Yi
{"title":"On Fixed-Priority Schedulability Analysis of Sporadic Tasks with Self-Suspension","authors":"M. Mohaqeqi, Pontus Ekberg, W. Yi","doi":"10.1145/2997465.2997485","DOIUrl":null,"url":null,"abstract":"We consider the schedulability analysis problem of a set of sporadic tasks which are subject to self-suspension, using a fixed-priority scheduler on a preemptive uniprocessor. We show that this problem is coNP-hard in the strong sense even in the simple case when only the lowest-priority task is self-suspending. Also, it is shown that the problem is weakly coNP-hard even if that self-suspending task has only a single suspension interval. In addition, we propose an efficient method for schedulability analysis of self-suspending tasks that are subject to interference from higher-priority tasks without self-suspension. The method works on the basis of an iterative approach which begins with an abstraction of the task set and improves the analysis results by refinement steps as needed. Our evaluation shows that this method significantly improves the scalability of the existing approaches.","PeriodicalId":245345,"journal":{"name":"Proceedings of the 24th International Conference on Real-Time Networks and Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 24th International Conference on Real-Time Networks and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2997465.2997485","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

We consider the schedulability analysis problem of a set of sporadic tasks which are subject to self-suspension, using a fixed-priority scheduler on a preemptive uniprocessor. We show that this problem is coNP-hard in the strong sense even in the simple case when only the lowest-priority task is self-suspending. Also, it is shown that the problem is weakly coNP-hard even if that self-suspending task has only a single suspension interval. In addition, we propose an efficient method for schedulability analysis of self-suspending tasks that are subject to interference from higher-priority tasks without self-suspension. The method works on the basis of an iterative approach which begins with an abstraction of the task set and improves the analysis results by refinement steps as needed. Our evaluation shows that this method significantly improves the scalability of the existing approaches.
具有自挂起的散发性任务的定优先可调度性分析
在抢占式单处理器上使用固定优先级调度程序,研究了一组自挂起的零星任务的可调度性分析问题。我们证明,即使在只有最低优先级的任务自挂起的简单情况下,这个问题在强意义上也是cop -hard。并且证明了即使自挂起任务只有一个挂起间隔,该问题也是弱coNP-hard的。此外,我们还提出了一种有效的自挂起任务可调度性分析方法,该方法可用于分析受高优先级任务干扰的自挂起任务。该方法工作在迭代方法的基础上,迭代方法从任务集的抽象开始,并根据需要通过细化步骤改进分析结果。我们的评估表明,该方法显著提高了现有方法的可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信