Competitive algorithms for fine-grain real-time scheduling

This paper investigates the task scheduling problem for real-time systems that provide rate of progress guarantees on task execution. A parameterized task system model, called (r, g) task system, is introduced that allows rate of progress requirements to be specified in terms of two simple parameters: an execution rate r and a granularity g. The granularity parameter is a metric that allows the specification of "fine-grain" timing constraints on the task's execution and is a generalization of the stretch metric used in research on task scheduling. It is shown that the product r lg (l/g) is an important determiner of the existence of good online scheduling algorithms. Specifically, there is an upper bound on this product above which there are no good online algorithms but below which an online algorithm with logarithmic competitive ratio exists. This paper also demonstrates a fundamental difference between two contrasting strategies for admission control: greedy vs. nongreedy. It is shown that "greed does not pay": there is a scheduling algorithm with a nongreedy admission policy that provably outperforms the well-known greedy EDF scheduling algorithm.

[1]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

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

[3]  Bhaskar Das Gupta,et al.  Online real-time preemptive scheduling of jobs with deadlines , 2000, APPROX.

[4]  Steve Goddard,et al.  A theory of rate-based execution , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[5]  Michael A. Palis.  On the Competitiveness of Online Real-Time Scheduling with Rate of Progress Guarantees , 2003, Int. J. Found. Comput. Sci..

[6]  Bhaskar DasGupta,et al.  Online real-time preemptive scheduling of jobs with deadlines , 2000, APPROX.

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

[8]  Joseph Naor,et al.  On-line admission control and packet scheduling with interleaving , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[9]  David K. Y. Yau,et al.  Adaptive rate-controlled scheduling for multimedia applications , 1997, TNET.

[10]  Aloysius Ka-Lau Mok,et al.  Fundamental design problems of distributed systems for the hard-real-time environment , 1983 .

[11]  Serge A. Plotkin.  Competitive Routing of Virtual Circuits in ATM Networks , 1995, IEEE J. Sel. Areas Commun..

[12]  Michael H. Goldwasser.  Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control , 1999, SODA '99.

[13]  Luca Becchetti,et al.  Scheduling to minimize average stretch without migration , 2000, SODA '00.

[14]  Sanjoy K. Baruah,et al.  Generalized Multiframe Tasks , 1999, Real-Time Systems.

[15]  Rajmohan Rajaraman,et al.  Online scheduling to minimize average stretch , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[16]  Aloysius K. Mok,et al.  A multiframe model for real-time tasks , 1996, 17th IEEE Real-Time Systems Symposium.

[17]  Michael B. Jones,et al.  An overview of the Rialto real-time architecture , 1996, EW 7.

[18]  Michael B. Jones,et al.  CPU reservations and time constraints: efficient, predictable scheduling of independent activities , 1997, SOSP.