IRTAW '02 Proceedings of the 11th international workshop on Real-time Ada workshop
Implementation of new Ada 2005 real-time services in MaRTE OS and GNAT
Ada-Europe'07 Proceedings of the 12th international conference on Reliable software technologies
Enabling mode changes in a distributed automotive system
Proceedings of the 1st Workshop on Critical Automotive applications: Robustness & Safety
Multi-processor schedulability analysis of preemptive real-time tasks with variable execution times
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
| Hi-index | 0.00 |
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.