{"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.