Performance guarantee for EDF under overload

Earliest deadline first (EDF) is a widely used algorithm for online deadline scheduling. It has been known for long that EDF is optimal for scheduling an underloaded, single-processor system; recent results on the extra-resource analysis of EDF further revealed that EDF when using moderately faster processors can achieve optimal performance in the underloaded, multi-processor setting. This paper initiates the extra-resource analysis of EDF for overloaded systems, showing that EDF supplemented with a simple form of admission control can provide a similar performance guarantee in both the single and multi-processor settings.

[1]  Aloysius K. Mok,et al.  Multiprocessor On-Line Scheduling of Hard-Real-Time Tasks , 1989, IEEE Trans. Software Eng..

[2]  Eric Torng,et al.  Applying extra-resource analysis to load balancing , 2000, SODA '00.

[3]  Tak Wah Lam,et al.  Trade-offs between speed and processor in hard-deadline scheduling , 1999, SODA '99.

[4]  Nodari Vakhania,et al.  Preemptive scheduling in overloaded systems , 2003, J. Comput. Syst. Sci..

[5]  Michael L. Dertouzos,et al.  Control Robotics: The Procedural Control of Physical Processes , 1974, IFIP Congress.

[6]  Piotr Berman,et al.  Speed is More Powerful than Clairvoyance , 1998, Nord. J. Comput..

[7]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract) , 1997, Symposium on the Theory of Computing.

[8]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

[9]  Dennis Shasha,et al.  MOCA: A Multiprocessor On-Line Competitive Algorithm for Real-Time System Scheduling , 1994, Theor. Comput. Sci..

[10]  Sanjoy K. Baruah,et al.  Overload tolerance for single-processor workloads , 1998, Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245).

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

[12]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[13]  Jeff Edmonds.  Scheduling in the dark , 2000, Theor. Comput. Sci..

[14]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation , 1997, STOC '97.

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