Analysis of hierarchical fixed-priority pre-emptive scheduling revisited
Reinder J. Bril, Pjl Pieter Cuijpers · TU/e Research Portal · 2006
This paper revisits worst-case response time analysis of real-time tasks under hierarchical fixed-priority preemptive scheduling.Using an example consisting of a single server and a single hard real-time task, we show that existing worst-case response time analysis can be improved for deferrable servers and sporadic servers when a server is exclusively used for hard real-time tasks.Moreover, we show that improving the existing analysis in this setting is not straightforward, because the worst-case response time of a task is not necessarily assumed for the first job when released at a critical instant.Finally, we briefly investigate best-case response times of tasks.