P.Seri, “Lex-optimal on-line multiclass scheduling with hard deadlines (2000) [1 citations — 0 self]
|
Abstract:
On-line scheduling of unit-length packets with hard deadlines by a single server in slotted time is considered. First, the set of all throughput optimal scheduling policies is characterized. Then multiclass packets are considered in which each packet has an M-bit class identier. A new optimality property called lex-optimality (short for lexicographic optimality) is dened for online scheduling policies. Lex-optimality is a hierarchical sequence of M throughput optimality properties, the jth property keying on the jth bit of the class identiers. The set of all lexoptimal policies that do not drop packets early is characterized. Both characterizations involve identi cation 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 buer size. The algorithm requires no more packets to be buered than any on-line throughput optimal scheduling policy, which need not account for priority classes. Simulation results are presented that illustrate that lex-optimality combines elements of pure priority and nested priority scheduling. 1
