Abstract
Adaptive and dynamic behaviour is seen as one of the key characteristics of next generation hard real-time systems. Whilst fixed priority pre-emptive scheduling is becoming a de facto standard in real-time system implementation, it remains inflexible in its purest form. One approach to countering this criticism is to allow optional components, not guaranteed offline, to be executed at nm-time. Optional components may be guaranteed a minimum set of resources at nm-time, with competing resource requests scheduled according to the best-effort approach. This allows increased dynamic behaviour and improves the utility of the system. In this paper, we discuss this integration of fixed priority and best-effort scheduling.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call