Scheduling Mixed-Criticality Systems to Guarantee Some Service under All Non-erroneous Behaviors

Sanjoy Baruah, A. Burns, Zhishan Guo
{"title":"Scheduling Mixed-Criticality Systems to Guarantee Some Service under All Non-erroneous Behaviors","authors":"Sanjoy Baruah, A. Burns, Zhishan Guo","doi":"10.1109/ECRTS.2016.12","DOIUrl":null,"url":null,"abstract":"Many reactive systems must be designed and analyzed prior to deployment in the presence of considerable epistemic uncertainty: the precise nature of the external environment the system will encounter, as well as the run-time behavior of the platform upon which it is implemented, cannot be predicted with complete certainty prior to deployment. The widely-studied Vestal model for mixed-criticality workloads addresses uncertainties in estimating the worst-case execution time (WCET) of real-time code. Different estimations, at different levels of assurance, are made about these WCET values, it is required that all functionalities execute correctly if the less conservative assumptions hold, while only the more critical functionalities are required to execute correctly in the (presumably less likely) event that the less conservative assumptions fail to hold but the more conservative assumptions do. A generalization of the Vestal model is considered here, in which a degraded (but non-zero) level of service is required for the less critical functionalities even in the event of only the more conservative assumptions holding. An algorithm is derived for scheduling dual-criticality implicit-deadline sporadic task systems specified in this more general model upon preemptive uniprocessor platforms, and proved to be speedup-optimal.","PeriodicalId":178974,"journal":{"name":"2016 28th Euromicro Conference on Real-Time Systems (ECRTS)","volume":"59 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"48","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 28th Euromicro Conference on Real-Time Systems (ECRTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECRTS.2016.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 48

Abstract

Many reactive systems must be designed and analyzed prior to deployment in the presence of considerable epistemic uncertainty: the precise nature of the external environment the system will encounter, as well as the run-time behavior of the platform upon which it is implemented, cannot be predicted with complete certainty prior to deployment. The widely-studied Vestal model for mixed-criticality workloads addresses uncertainties in estimating the worst-case execution time (WCET) of real-time code. Different estimations, at different levels of assurance, are made about these WCET values, it is required that all functionalities execute correctly if the less conservative assumptions hold, while only the more critical functionalities are required to execute correctly in the (presumably less likely) event that the less conservative assumptions fail to hold but the more conservative assumptions do. A generalization of the Vestal model is considered here, in which a degraded (but non-zero) level of service is required for the less critical functionalities even in the event of only the more conservative assumptions holding. An algorithm is derived for scheduling dual-criticality implicit-deadline sporadic task systems specified in this more general model upon preemptive uniprocessor platforms, and proved to be speedup-optimal.
调度混合临界系统保证所有非错误行为下的部分服务
许多响应式系统必须在部署之前进行设计和分析,因为存在相当大的认知不确定性:系统将遇到的外部环境的精确性质,以及实现系统的平台的运行时行为,在部署之前无法完全确定地预测。广泛研究的混合临界工作负载Vestal模型解决了实时代码估计最坏情况执行时间(WCET)的不确定性。在不同的保证水平上,对这些WCET值进行了不同的估计,如果不太保守的假设成立,则要求所有功能都正确执行,而在不太可能的情况下,只有更关键的功能才需要正确执行,因为不太保守的假设不成立,而更保守的假设成立。这里考虑了Vestal模型的一般化,其中对于不太关键的功能,即使在只有更保守的假设成立的情况下,也需要降级(但非零)的服务水平。在抢占式单处理机平台上,推导了一种更通用的双临界隐式截止日期偶发任务系统调度算法,并证明了该算法的速度最优性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信