Preemptive scheduling in overloaded systems

The following scheduling problem is studied: We are given a set of tasks with release times, deadlines, and profit rates. The objective is to determine a 1-processor preemptive schedule of the given tasks that maximizes the overall profit. In the standard model, each completed task brings profit, while noncompleted tasks do not. In the metered model, a task brings profit proportional to the execution time even if not completed. For the metered task model, we present an efficient offline algorithm and improve both the lower and upper bounds on the competitive ratio of online algorithms. Furthermore, we prove three lower bound results concerning resource augmentation in both models.

[1]  Tak Wah Lam,et al.  On the speed requirement for optimal deadline scheduling in overloaded systems , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[2]  Dennis Shasha,et al.  D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems , 1995, SIAM J. Comput..

[3]  Kunihiko Sadakane,et al.  On-line scheduling with tight deadlines , 2003, Theor. Comput. Sci..

[4]  Sanjoy K. Baruah,et al.  On the competitiveness of on-line real-time task scheduling , 2004, Real-Time Systems.

[5]  Tak Wah Lam,et al.  Competitive Deadline Scheduling via Additional or Faster Processors , 2003, J. Sched..

[6]  Jean-Philippe Vial,et al.  Theory and algorithms for linear optimization - an interior point approach , 1998, Wiley-Interscience series in discrete mathematics and optimization.

[7]  Nodari Vakhania,et al.  Preemptive Scheduling in Overloaded Systems , 2002, ICALP.

[8]  Jirí Sgall,et al.  On-line Scheduling , 1996, Online Algorithms.

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

[10]  Tak Wah Lam,et al.  Trade-offs between speed and processor in hard-deadline scheduling , 1999, SODA '99.

[11]  Ee-Chien Chang,et al.  Competitive Online Scheduling with Level of Service , 2001, COCOON.

[12]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[13]  Francis Y. L. Chin,et al.  Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help? , 2003, Algorithmica.