Hierarchical Fixed Priority Scheduling
R.I. Davis and A. Burns
This paper focuses on the hierarchical scheduling of systems where a number of separate applications reside on a single processor. It addresses the particular case where fixed priority pre-emptive scheduling is used at both global and local levels, with a server associated with each application. Using response time analysis, an exact schedulability test is derived for application tasks. This test improves on previously published work. The analysis is extended to the case of harmonic tasks that can be bound to the release of their server. These tasks exhibit improved schedulability indicating that it is advantageous to choose server periods that enable some tasks to be bound to the release of their server. The use of Periodic, Sporadic and Deferrable Servers is considered with the conclusion that the simple Periodic Server dominates both Sporadic and Deferrable Servers when the metric is application task schedulability.
BibTex Entry
@inproceedings{Davis2005a,
author = {R.I. Davis and A. Burns},
booktitle = {Proceedings of the 26th IEEE Real-Time Systems Symposium},
month = {5-8 Dec},
organization = {IEEE Computer Society},
pages = {389--398},
title = {Hierarchical Fixed Priority Scheduling},
year = {2005}
}