Bounding the Power of Preemption in Randomized Scheduling
SIAM Journal on Computing
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Maximizing job completions online
Journal of Algorithms
Considering suppressed packets improves buffer management in QoS switches
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
SIAM Journal on Computing
A fast on-line algorithm for the preemptive scheduling of equal-length jobs on a single processor
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
A near optimal scheduler for on-demand data broadcasts
Theoretical Computer Science
Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the 'tower of sets' property
Mathematical and Computer Modelling: An International Journal
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
Operations Research Letters
Preemptive scheduling of equal-length jobs to maximize weighted throughput
Operations Research Letters
| Hi-index | 0.00 |
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 r j , and has processing time p j , deadline d j , and weight w j . 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 most k, 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.