Premium
A flexible real‐time scheduling abstraction: design and implementation
Author(s) -
Lo Siu Ling Ann,
Hutchinson Norman C.,
Chanson Samuel T.
Publication year - 1997
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/(sici)1097-024x(199709)27:9<1055::aid-spe122>3.0.co;2-q
Subject(s) - computer science , scheduling (production processes) , distributed computing , thread (computing) , fair share scheduling , dynamic priority scheduling , real time operating system , operating system , engineering , schedule , operations management
An evolution is happening in the way that operating systems support the real‐time requirements of their applications. The need to run real‐time applications such as multimedia in the same environment as complex non‐real‐time servers and applications has motivated much interest in restructuring existing operating systems. Many issues related to thread scheduling and synchronization have been investigated. However, little consideration has been given to the flexibility and modularity required in the support of application‐level scheduling needs, although it is well known that application requirements are diverse. In this paper, we describe a real‐time scheduling abstraction which provides modularity and flexibility to the scheduling support of operating systems. Our design has been implemented using the Mach 3.0 kernel and a locally developed multiprocessor kernel (the r ‐kernel) as development platforms. © 1997 John Wiley & Sons, Ltd.