Online scheduling of bounded length jobs to maximize throughput

We consider an online scheduling problem, motivated by the issues present at the joints of networks using ATM and TCP/IP. Namely, IP packets have to be broken down into small ATM cells and sent out before their deadlines, but cells corresponding to different packets can be interwoven. More formally, we consider the online scheduling problem with preemptions, where each job j is revealed at release time rj, and has processing time pj, deadline dj, and weight wj. A preempted job can be resumed at any time. The goal is to maximize the total weight of all jobs completed on time. Our main results are as follows. Firstly, we prove that when the processing times of all jobs are at mostk, the optimum deterministic competitive ratio is Θ(k/log k). Secondly, we give a deterministic algorithm with competitive ratio depending on the ratio between the smallest and the largest processing time of all jobs. In particular, it attains competitive ratio 5 in the case when all jobs have identical processing times, for which we give a lower bound of 2.598. The latter upper bound also yields an O(log k)-competitive randomized algorithm for the variant with processing times bounded by k.

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

[2]  E. L. Lawler,et al.  Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the 'tower of sets' property , 1994 .

[3]  Bala Kalyanasundaram,et al.  Maximizing job completions online , 1998, J. Algorithms.

[4]  Nodari Vakhania,et al.  Preemptive scheduling of equal-length jobs to maximize weighted throughput , 2002, Oper. Res. Lett..

[5]  Prudence W. H. Wong,et al.  New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation , 2004, COCOON.

[6]  Nodari Vakhania.  A fast on-line algorithm for the preemptive scheduling of equal-length jobs on a single processor , 2008 .

[7]  Amos Fiat,et al.  Competitive non-preemptive call control , 1994, SODA '94.

[8]  Gerhard J. Woeginger,et al.  A Review of Machine Scheduling: Complexity, Algorithms and Approximability , 1998 .

[9]  Sanjoy K. Baruah,et al.  On-line scheduling to maximize task completions , 1994, 1994 Proceedings Real-Time Systems Symposium.

[10]  Matthias Englert,et al.  Considering suppressed packets improves buffer management in QoS switches , 2007, SODA '07.

[11]  Sandy Irani,et al.  Bounding the power of preemption in randomized scheduling , 1995, STOC '95.

[12]  Marek Chrobak,et al.  Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help , 2007, SIAM J. Comput..

[13]  Philippe Baptiste,et al.  An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs , 1999, Oper. Res. Lett..

[14]  Hing-Fung Ting.  A Near Optimal Scheduler for On-Demand Data Broadcasts , 2006, CIAC.

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