Sciweavers

Share
APPROX
2000
Springer

Online real-time preemptive scheduling of jobs with deadlines

9 years 17 days ago
Online real-time preemptive scheduling of jobs with deadlines
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized in terms of their minimum stretch factor α (or, equivalently, their maximum execution rate r = 1/α). We consider two well known preemptive models that are of interest from practical applications: the hard real-time scheduling model in which a job must be completed if it was admitted for execution by the online scheduler, and the firm real-time scheduling model in which the scheduler is allowed not to complete a job even if it was admitted for execution by the online scheduler. In both models, the objective is to maximize the sum of execution times of the jobs that were executed to completion, preemption is allowed, and the online scheduler must immediately decide, whenever a job arrives, whether to admit it for execution or reject it. We measure the competitive ratio of any online algorithm as the ratio of...
Bhaskar DasGupta, Michael A. Palis
Added 02 Aug 2010
Updated 02 Aug 2010
Type Conference
Year 2000
Where APPROX
Authors Bhaskar DasGupta, Michael A. Palis
Comments (0)
books