TY - JOUR
T1 - Deadline monotonic scheduling theory and application
AU - Audsley, N. C.
AU - Burns, A.
AU - Wellings, A. J.
PY - 1993/1/1
Y1 - 1993/1/1
N2 - Scheduling theories are now sufficiently mature that a genuine engineering approach to the construction of hard real-time systems is possible. In this paper we discuss the application of Deadline Monotonic Scheduling Theory (DMST). This theory is an extension of the more familiar approach based on rate monotonic priority assignment. The model presented can accomodate periodic and sporadic processes, different levels of criticality, process interaction and blocking, precedence constrained processes and multi-deadline processes. It is particularly well integrated with the use of Immediate Priority Ceiling Inheritance for control over process blocking. A basic pseudo-polynomial schedulability test is outlined and then supplemented by the introduction of offsets to control jitter, and period transformation to enable critical (hard) processes to be "protected" during potential transient overloads. These mathematical techniques derived within DMST can help designers experiment with alternative formulations and prove essential properties of systems before they are deployed.
AB - Scheduling theories are now sufficiently mature that a genuine engineering approach to the construction of hard real-time systems is possible. In this paper we discuss the application of Deadline Monotonic Scheduling Theory (DMST). This theory is an extension of the more familiar approach based on rate monotonic priority assignment. The model presented can accomodate periodic and sporadic processes, different levels of criticality, process interaction and blocking, precedence constrained processes and multi-deadline processes. It is particularly well integrated with the use of Immediate Priority Ceiling Inheritance for control over process blocking. A basic pseudo-polynomial schedulability test is outlined and then supplemented by the introduction of offsets to control jitter, and period transformation to enable critical (hard) processes to be "protected" during potential transient overloads. These mathematical techniques derived within DMST can help designers experiment with alternative formulations and prove essential properties of systems before they are deployed.
KW - hard real-time scheduling
KW - rate monotonic
KW - schedulability constraints
UR - http://www.scopus.com/inward/record.url?scp=0027539123&partnerID=8YFLogxK
U2 - 10.1016/0967-0661(93)92105-D
DO - 10.1016/0967-0661(93)92105-D
M3 - Article
AN - SCOPUS:0027539123
SN - 0967-0661
VL - 1
SP - 71
EP - 78
JO - Control engineering practice
JF - Control engineering practice
IS - 1
ER -