|
Published Articles >> Table of Contents >> Abstract
26th IEEE International Real-Time Systems Symposium (RTSS'05)
pp. 389-398
Hierarchical Fixed Priority Pre-Emptive Scheduling
R. I. Davis, University of York
A. Burns, University of York
Full Article Text:
 
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTSS.2005.25
Send link to a friend
| Abstract |
|
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.
|
 Additional Information
|
Citation:
R. I. Davis, A. Burns,
"Hierarchical Fixed Priority Pre-Emptive Scheduling,"
rtss,
pp. 389-398,
26th IEEE International Real-Time Systems Symposium (RTSS'05),
2005
|
|
