Combining Task-level and System-level Scheduling Modes for Mixed Criticality Systems

Jalil Boudjadar, Saravanan Ramanathan, A. Easwaran, Ulrik Nyman
{"title":"Combining Task-level and System-level Scheduling Modes for Mixed Criticality Systems","authors":"Jalil Boudjadar, Saravanan Ramanathan, A. Easwaran, Ulrik Nyman","doi":"10.1109/DS-RT47707.2019.8958666","DOIUrl":null,"url":null,"abstract":"Different scheduling algorithms for mixed criticality systems have been recently proposed. The common denominator of these algorithms is to discard low critical tasks whenever high critical tasks are in lack of computation resources. This is achieved upon a switch of the scheduling mode from Normal to Critical. We distinguish two main categories of the algorithms: system-level mode switch and task-level mode switch. System-level mode algorithms allow low criticality (LC) tasks to execute only in normal mode. Task-level mode switch algorithms enable to switch the mode of an individual high criticality task (HC), from low (LO) to high (HI), to obtain priority over all LC tasks. This paper investigates an online scheduling algorithm for mixed-criticality systems that supports dynamic mode switches for both task level and system level. When a HC task job overruns its LC budget, then only that particular job is switched to HI mode. If the job cannot be accommodated, then the system switches to Critical mode. To accommodate for resource availability of the HC jobs, the LC tasks are degraded by stretching their periods until the Critical mode exhibiting job complete its execution. The stretching will be carried out until the resource availability is met. We have mechanized and implemented the proposed algorithm using Uppaal. To study the efficiency of our scheduling algorithm, we examine a case study and compare our results to the state of the art algorithms.","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DS-RT47707.2019.8958666","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Different scheduling algorithms for mixed criticality systems have been recently proposed. The common denominator of these algorithms is to discard low critical tasks whenever high critical tasks are in lack of computation resources. This is achieved upon a switch of the scheduling mode from Normal to Critical. We distinguish two main categories of the algorithms: system-level mode switch and task-level mode switch. System-level mode algorithms allow low criticality (LC) tasks to execute only in normal mode. Task-level mode switch algorithms enable to switch the mode of an individual high criticality task (HC), from low (LO) to high (HI), to obtain priority over all LC tasks. This paper investigates an online scheduling algorithm for mixed-criticality systems that supports dynamic mode switches for both task level and system level. When a HC task job overruns its LC budget, then only that particular job is switched to HI mode. If the job cannot be accommodated, then the system switches to Critical mode. To accommodate for resource availability of the HC jobs, the LC tasks are degraded by stretching their periods until the Critical mode exhibiting job complete its execution. The stretching will be carried out until the resource availability is met. We have mechanized and implemented the proposed algorithm using Uppaal. To study the efficiency of our scheduling algorithm, we examine a case study and compare our results to the state of the art algorithms.
混合临界系统的任务级和系统级组合调度模式
针对混合临界系统,近年来提出了不同的调度算法。这些算法的共同点是,当高关键任务缺乏计算资源时,丢弃低关键任务。通过将调度模式从“正常”切换为“紧急”实现。我们将算法分为两大类:系统级模式切换和任务级模式切换。系统级模式算法允许低临界(LC)任务仅在正常模式下执行。任务级模式切换算法允许将单个高临界任务(HC)的模式从低(LO)切换到高(HI),以获得高于所有LC任务的优先级。研究了一种支持任务级和系统级动态模式切换的混合临界系统在线调度算法。当HC任务作业超出其LC预算时,则只有该特定作业切换到HI模式。如果无法容纳该作业,则系统将切换到Critical模式。为了适应HC作业的资源可用性,LC任务通过延长其周期来降级,直到显示作业的Critical模式完成其执行。将执行拉伸,直到满足资源可用性。我们使用Uppaal实现了该算法的机械化和实现。为了研究我们的调度算法的效率,我们研究了一个案例研究,并将我们的结果与最先进的算法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信