Online scheduling of bounded length jobs to maximize throughput

Authors:
Christoph Dürr;Łukasz Jeż;Kim Thang Nguyen
Affiliations:
CNRS, LIX UMR 7161, Ecole Polytechnique, Palaiseau, France;Institute of Computer Science, University of Wrocław, Wrocław, Poland;CNRS, LIX UMR 7161, Ecole Polytechnique, Palaiseau, France
Venue:
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Year:
2009

Citing 9
Cited 2

Bounding the Power of Preemption in Randomized Scheduling

SIAM Journal on Computing
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
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

Improved online scheduling in maximizing throughput of equal length jobs

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Online scheduling with preemption or non-completion penalties

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 broken down to 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, 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: we prove that if all jobs have processing time exactlyk, the deterministic competitive ratio is between 2.598 and 5, and when the processing times are at mostk, the deterministic competitive ratio is Θ(k/logk).