By Topic

Predictable distributed dynamic scheduling in RTDOS

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
B. R. Swim ; Coll. of Comput. & Inf. Eng., King Saud Univ., Riyadh, Saudi Arabia ; M. Benmaiza ; M. Tayli ; M. C. Woodward

Future dynamic distributed hard real-time systems may control unpredictable environments, and will need predictable and flexible runtime systems that can handle unknown and changing task populations. In this extreme case not only is task scheduling dynamic, but the system topology and architecture might be adapted to unforeseen configurations. The paper addresses the difficult problem of dynamic distributed task scheduling. A new predictable dynamic deadline guarantee scheme has been designed and implemented in the authors' real-time distributed operating system (RTDOS). The algorithms have been proven to guarantee task deadlines even during transient overloads. RTDOS is designed to tackle unpredictable and highly dynamic environments; therefore its task model is quite unrestrictive, supporting periodic and aperiodic tasks both with arbitrary release times and deadlines. The authors place no restriction on the inter-arrival times between and aperiodic task instances. Moreover, their resource scheduling considers precedence constraints, device allocation and communication requirements. As a consequence, the results can be generalised and applied to many real-time domains. Furthermore, the complexity of the authors' schedulability test has been proved to be O(n). A domain-wide scheduler is described, which maintains its predicted maximum response time even when local nodes are under heavy load. Experimental results confirm the proven expectations of our scheduling scheme

Published in:

IEE Proceedings - Computers and Digital Techniques  (Volume:144 ,  Issue: 3 )