Lex-Optimal Online Multiclass Scheduling with Hard Deadlines

Online scheduling of unit-length packets with hard deadlines by a single server in slotted time is considered. First, the throughput optimal scheduling policies are characterized. Then multiclass packets are considered in which each packet has an M-bit class identifier, and a new optimality property called lex-optimality (short for lexicographic optimality) is defined for online scheduling policies. Lex-optimality is a hierarchical sequence of M throughput optimality properties. The lex-optimal policies that do not drop packets early are characterized. Both characterizations involve identification of a "no-regret subset" of the set of packets available for scheduling in a given slot. A lex-optimal scheduling algorithm is presented with complexity per packet O(MB), where M is the log of the number of priority classes and B is the maximum buffer size. The algorithm requires no more packets to be buffered than any online, throughput optimal scheduling policy. Simulation results are presented that illustrate that lex-optimality combines elements of pure priority and nested priority scheduling.

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

[2]  Krithi Ramamritham,et al.  Hard Real-Time Systems , 1988 .

[3]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[4]  Andrew S. Tanenbaum,et al.  Computer networks (3rd ed.) , 1996 .

[5]  S. Pingali,et al.  On scheduling two classes of real-time traffic with identical deadlines , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[6]  Donald F. Towsley,et al.  Scheduling policies for real-time and non-real-time traffic in a statistical multiplexer , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[7]  Bruce S. Davie,et al.  Computer Networks: A Systems Approach, 3rd Edition , 2003 .

[8]  C. D. Locke,et al.  Best-effort decision-making for real-time scheduling , 1986 .

[9]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[10]  Giorgio Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications , 1997 .

[11]  Bruce Hajek.  On the Competitiveness of On-Line Scheduling of Unit-Length Packets with Hard Deadlines in Slotted Time , 2001 .

[12]  Ness B. Shroff,et al.  Scheduling real-time traffic in ATM networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[13]  Robert E. Tarjan,et al.  Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines , 1981, SIAM J. Comput..

[14]  Gary M. Koob,et al.  Foundations of Real-Time Computing: Formal Specifications and Methods , 1991 .

[15]  Jeffrey J. Hunter,et al.  Mathematical techniques of applied probability , 1985 .

[16]  Eugene Lawler,et al.  Combinatorial optimization , 1976 .

[17]  Ian C. Pyle,et al.  Real-Time Systems: Investigating Industrial Practice , 1993 .

[18]  Gary M. Koob,et al.  Foundations of Real-Time Computing: Scheduling and Resource Management , 1991 .

[19]  Jon M. Peha,et al.  Evaluating scheduling algorithms for traffic with heterogeneous performance objectives , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[20]  Aloysius K. Mok,et al.  Towards Mechanization of Real-Time System Design , 1991 .