非抢占式严格周期性任务与抢占式偶发任务组合的可调度性分析

M. Marouf, L. George, Y. Sorel
{"title":"非抢占式严格周期性任务与抢占式偶发任务组合的可调度性分析","authors":"M. Marouf, L. George, Y. Sorel","doi":"10.1109/ETFA.2012.6489569","DOIUrl":null,"url":null,"abstract":"We consider the problem of fixed priority scheduling of non-preemptive strict periodic tasks in conjunction with sporadic preemptive tasks. There are few studies about the scheduling problem combining these two kinds of tasks. Moreover, only few results are available on scheduling non-preemptive strict periodic tasks since their performance analysis gives low success ratios, except in the case of harmonic tasks. Also, strict periodic tasks are of great importance since they are in charge for example of sensors/actuators or feedback control functions which are all critical in feedback control systems. Such tasks must have the highest priorities in order to guarantee a correct behavior of the control system. Preemptive sporadic tasks can be used for non critical functions and have lower priorities. We first investigate the scheduling problem of non-preemptive strict periodic tasks by recalling an existing schedulability condition. This results in defining the first release times of strict periodic tasks that preserves the strict periodicity constraints. We show that the schedule of strict periodic tasks can have transient and permanent phases. Then, assuming that some non-preemptive strict periodic tasks have been scheduled, we characterize the release times of the sporadic tasks that maximize their worst case response times. We prove that these release times can be restricted to the permanent phase. For preemptive sporadic tasks, we extend the classical worst case response time computation to take into account non-preemptive strict periodic tasks. Finally, we consider the particular case where some of the sporadic tasks are alternate tasks to primary strict periodic tasks for fault-tolerance.","PeriodicalId":222799,"journal":{"name":"Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies & Factory Automation (ETFA 2012)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Schedulability analysis for a combination of non-preemptive strict periodic tasks and preemptive sporadic tasks\",\"authors\":\"M. Marouf, L. George, Y. Sorel\",\"doi\":\"10.1109/ETFA.2012.6489569\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of fixed priority scheduling of non-preemptive strict periodic tasks in conjunction with sporadic preemptive tasks. There are few studies about the scheduling problem combining these two kinds of tasks. Moreover, only few results are available on scheduling non-preemptive strict periodic tasks since their performance analysis gives low success ratios, except in the case of harmonic tasks. Also, strict periodic tasks are of great importance since they are in charge for example of sensors/actuators or feedback control functions which are all critical in feedback control systems. Such tasks must have the highest priorities in order to guarantee a correct behavior of the control system. Preemptive sporadic tasks can be used for non critical functions and have lower priorities. We first investigate the scheduling problem of non-preemptive strict periodic tasks by recalling an existing schedulability condition. This results in defining the first release times of strict periodic tasks that preserves the strict periodicity constraints. We show that the schedule of strict periodic tasks can have transient and permanent phases. Then, assuming that some non-preemptive strict periodic tasks have been scheduled, we characterize the release times of the sporadic tasks that maximize their worst case response times. We prove that these release times can be restricted to the permanent phase. For preemptive sporadic tasks, we extend the classical worst case response time computation to take into account non-preemptive strict periodic tasks. Finally, we consider the particular case where some of the sporadic tasks are alternate tasks to primary strict periodic tasks for fault-tolerance.\",\"PeriodicalId\":222799,\"journal\":{\"name\":\"Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies & Factory Automation (ETFA 2012)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies & Factory Automation (ETFA 2012)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ETFA.2012.6489569\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies & Factory Automation (ETFA 2012)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ETFA.2012.6489569","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

摘要

结合零星抢占任务,研究了非抢占式严格周期任务的固定优先级调度问题。结合这两类任务的调度问题研究较少。此外,除了谐波任务外,对非抢占式严格周期任务调度的性能分析成功率较低,研究结果很少。此外,严格的周期性任务非常重要,因为它们负责例如传感器/执行器或反馈控制功能,这些都是反馈控制系统中至关重要的。这些任务必须具有最高的优先级,以保证控制系统的正确行为。抢占式零星任务可以用于非关键功能,优先级较低。我们首先通过回顾一个已有的可调度条件来研究非抢占式严格周期任务的调度问题。这将导致定义严格周期性任务的第一次发布时间,从而保持严格的周期性约束。我们证明了严格周期任务的调度可以有暂态和永久阶段。然后,假设已经安排了一些非抢占式的严格周期性任务,我们描述了使其最坏情况响应时间最大化的零星任务的释放时间。我们证明了这些释放时间可以被限制在永久阶段。对于抢占式偶发任务,我们将经典的最坏情况响应时间计算扩展到考虑非抢占式严格周期性任务。最后,我们考虑了一些特殊情况,其中一些零星任务是主要严格周期性任务的替代任务,以实现容错。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Schedulability analysis for a combination of non-preemptive strict periodic tasks and preemptive sporadic tasks
We consider the problem of fixed priority scheduling of non-preemptive strict periodic tasks in conjunction with sporadic preemptive tasks. There are few studies about the scheduling problem combining these two kinds of tasks. Moreover, only few results are available on scheduling non-preemptive strict periodic tasks since their performance analysis gives low success ratios, except in the case of harmonic tasks. Also, strict periodic tasks are of great importance since they are in charge for example of sensors/actuators or feedback control functions which are all critical in feedback control systems. Such tasks must have the highest priorities in order to guarantee a correct behavior of the control system. Preemptive sporadic tasks can be used for non critical functions and have lower priorities. We first investigate the scheduling problem of non-preemptive strict periodic tasks by recalling an existing schedulability condition. This results in defining the first release times of strict periodic tasks that preserves the strict periodicity constraints. We show that the schedule of strict periodic tasks can have transient and permanent phases. Then, assuming that some non-preemptive strict periodic tasks have been scheduled, we characterize the release times of the sporadic tasks that maximize their worst case response times. We prove that these release times can be restricted to the permanent phase. For preemptive sporadic tasks, we extend the classical worst case response time computation to take into account non-preemptive strict periodic tasks. Finally, we consider the particular case where some of the sporadic tasks are alternate tasks to primary strict periodic tasks for fault-tolerance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信