Offsets for scheduling mode changes

J. Real, A. Crespo
{"title":"Offsets for scheduling mode changes","authors":"J. Real, A. Crespo","doi":"10.1109/EMRTS.2001.933989","DOIUrl":null,"url":null,"abstract":"In multi-moded real-time systems there may exist a different set of tasks per mode. During its mission, the system may switch to a new operating mode, which will involve completing running old-mode tasks and starting new-mode tasks. This represents a transient, bounded overload, which may not be schedulable unless some new-mode tasks are delayed until the old-mode load has decreased. Although this idea has already been proposed elsewhere, a method for obtaining the shortest offsets that make a transition schedulable has not yet been devised. The management of shared resources during the transition represents an added problem to tackle. This paper presents a new mode change protocol and an algorithm to calculate the necessary offsets to schedule mode changes according to a set of requirements and in the presence of shared resources.","PeriodicalId":292136,"journal":{"name":"Proceedings 13th Euromicro Conference on Real-Time Systems","volume":"1233 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 13th Euromicro Conference on Real-Time Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMRTS.2001.933989","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

In multi-moded real-time systems there may exist a different set of tasks per mode. During its mission, the system may switch to a new operating mode, which will involve completing running old-mode tasks and starting new-mode tasks. This represents a transient, bounded overload, which may not be schedulable unless some new-mode tasks are delayed until the old-mode load has decreased. Although this idea has already been proposed elsewhere, a method for obtaining the shortest offsets that make a transition schedulable has not yet been devised. The management of shared resources during the transition represents an added problem to tackle. This paper presents a new mode change protocol and an algorithm to calculate the necessary offsets to schedule mode changes according to a set of requirements and in the presence of shared resources.
调度模式变更的偏移量
在多模式实时系统中,每个模式可能存在一组不同的任务。在执行任务期间,系统可能会切换到新的运行模式,这将涉及完成运行旧模式任务并启动新模式任务。这表示一个短暂的、有界的过载,除非一些新模式任务延迟到旧模式负载减少,否则它可能无法调度。虽然这个想法已经在其他地方提出了,但还没有设计出一种方法来获得使转换可调度的最短偏移量。在过渡期间对共享资源的管理是另一个需要解决的问题。本文提出了一种新的模式转换协议,并给出了在共享资源存在的情况下,根据一组需求计算调度模式转换所需的偏移量的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信