处理执行超时以提高调度FP和EDF实时系统的时间鲁棒性

Lamine Bougueroua Esigetel
{"title":"处理执行超时以提高调度FP和EDF实时系统的时间鲁棒性","authors":"Lamine Bougueroua Esigetel","doi":"10.1109/ICONS.2007.18","DOIUrl":null,"url":null,"abstract":"This paper presents a mechanism for execution-overrun management in preemptive real-time systems composed of sporadic tasks. We consider faults due to Worst Case Execution Time violations. Based on fault prevention, we determine the allowance of a task defined as the maximum extra duration that can be granted to a faulty task without compromising the timeliness constraints of the tasks. We propose a solution to implement the allowance principle that we call the Latest Execution Time (LET), defined for a task as the latest absolute time a faulty task can proceed with its execution without compromising the real-time constraints of all the tasks in the system. This mechanism enables to cope with execution overruns before a deadline miss and is not based on execution overruns handlers. We show how to determine the LET based on existing real-time feasibility conditions for Fixed Priority (FP) and Earliest Deadline First (EDF) schedulings. We compare the performances of the LET mechanism with FP and EDF scheduling to classical execution overrun management solutions.","PeriodicalId":355435,"journal":{"name":"Second International Conference on Systems (ICONS'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"Dealing with execution-overruns to improve the temporal robustness of real-time systems scheduled FP and EDF\",\"authors\":\"Lamine Bougueroua Esigetel\",\"doi\":\"10.1109/ICONS.2007.18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a mechanism for execution-overrun management in preemptive real-time systems composed of sporadic tasks. We consider faults due to Worst Case Execution Time violations. Based on fault prevention, we determine the allowance of a task defined as the maximum extra duration that can be granted to a faulty task without compromising the timeliness constraints of the tasks. We propose a solution to implement the allowance principle that we call the Latest Execution Time (LET), defined for a task as the latest absolute time a faulty task can proceed with its execution without compromising the real-time constraints of all the tasks in the system. This mechanism enables to cope with execution overruns before a deadline miss and is not based on execution overruns handlers. We show how to determine the LET based on existing real-time feasibility conditions for Fixed Priority (FP) and Earliest Deadline First (EDF) schedulings. We compare the performances of the LET mechanism with FP and EDF scheduling to classical execution overrun management solutions.\",\"PeriodicalId\":355435,\"journal\":{\"name\":\"Second International Conference on Systems (ICONS'07)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-04-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Second International Conference on Systems (ICONS'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICONS.2007.18\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Second International Conference on Systems (ICONS'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICONS.2007.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22

摘要

提出了一种由零星任务组成的抢占式实时系统的执行超时管理机制。我们考虑由于违反最坏情况执行时间而导致的故障。基于故障预防,我们确定了任务的容忍度,该容忍度定义为在不影响任务的时效性约束的情况下,可以授予故障任务的最大额外持续时间。我们提出了一个解决方案来实现允许原则,我们称之为最晚执行时间(LET),它定义为一个任务在不影响系统中所有任务的实时约束的情况下,一个错误的任务可以继续执行的最晚绝对时间。此机制支持在错过截止日期之前处理执行超时,并且不基于执行超时处理程序。我们展示了如何根据固定优先级(FP)和最早截止日期优先(EDF)调度的现有实时可行性条件确定LET。我们比较了LET机制与FP和EDF调度与经典执行超时管理解决方案的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dealing with execution-overruns to improve the temporal robustness of real-time systems scheduled FP and EDF
This paper presents a mechanism for execution-overrun management in preemptive real-time systems composed of sporadic tasks. We consider faults due to Worst Case Execution Time violations. Based on fault prevention, we determine the allowance of a task defined as the maximum extra duration that can be granted to a faulty task without compromising the timeliness constraints of the tasks. We propose a solution to implement the allowance principle that we call the Latest Execution Time (LET), defined for a task as the latest absolute time a faulty task can proceed with its execution without compromising the real-time constraints of all the tasks in the system. This mechanism enables to cope with execution overruns before a deadline miss and is not based on execution overruns handlers. We show how to determine the LET based on existing real-time feasibility conditions for Fixed Priority (FP) and Earliest Deadline First (EDF) schedulings. We compare the performances of the LET mechanism with FP and EDF scheduling to classical execution overrun management solutions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信