Towards a stable Earliest Deadline scheduling algorithm

Earliest Deadline algorithm is today the most attractive real-time scheduling theory. However, should the processor experience a transient overload, Earliest Deadline scheduling can not directly ensure that almost the most important tasks of the application are guaranteed. Schedulability condition should be employed to detect transient overloads before they occur, so that these transient overloads can be handle in an appropriate way. We say that Earliest Deadline scheduling is then unstable. The Regisseur is a real-time scheduling controller which provides the stability property to the Earliest Deadline scheduler by the mean of an importance criterion and by the mean of such schedulability condition. In this paper, we first describe the Regisseur principles and the way it works. Then an example is given to point out its performances.

[1]  Jirí Sgall,et al.  On-line Scheduling , 1996, Online Algorithms.

[2]  Hideyuki Tokuda,et al.  A Time-Driven Scheduling Model for Real-Time Operating Systems , 1985, RTSS.

[3]  Sudarshan Kumar Dhall,et al.  Scheduling periodic-time - critical jobs on single processor and multiprocessor computing systems. , 1977 .

[4]  Jay K. Strosnider,et al.  Reducing problem-solving variance to improve predictability , 1991, CACM.

[5]  Frans Sijstermans,et al.  CD-I full-motion video encoding on a parallel computer , 1991, CACM.

[6]  Krithi Ramamritham,et al.  Evaluation of a flexible task scheduling algorithm for distributed hard real-time systems , 1985, IEEE Transactions on Computers.

[7]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on a Single Machine with Precedence Constraints , 1990, INFORMS J. Comput..

[8]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[9]  Jane W.-S. Liu,et al.  Algorithms for scheduling periodic jobs to minimize average error , 1988, Proceedings. Real-Time Systems Symposium.

[10]  Joelle Delacroix,et al.  A test bed for distributed real-time scheduling experimentation based on the CHORUS micro-kernel , 1995 .

[11]  David W. Payton,et al.  Intelligent real-time control of robotic vehicles , 1991, CACM.

[12]  Kang G. Shin,et al.  Load Sharing in Distributed Real-Time Systems with State-Change Broadcasts , 1989, IEEE Trans. Computers.

[13]  J. Delacroix.  Stabilité et régisseur d'ordonnancement en temps réel , 1994 .

[14]  Geneva G. Belford,et al.  SIMULATIONS OF A FAULT-TOLERANT DEADLINE MECHANISM. , 1979 .

[15]  Graham McMahon,et al.  On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness , 1975, Oper. Res..

[16]  Joëlle Delacroix.  Un controleur d'ordonnancement temps reel pour la stabilite de earliest deadline en surcharge : le regisseur , 1994 .

[17]  Dennis Shasha,et al.  D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems , 1995, SIAM J. Comput..

[18]  Leonidas Georgiadis,et al.  On optimal lateness and tardiness scheduling in real-time systems , 2006, Computing.

[19]  Lui Sha,et al.  Aperiodic task scheduling for Hard-Real-Time systems , 2006, Real-Time Systems.

[20]  Sanjoy K. Baruah,et al.  On-line scheduling in the presence of overload , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.