Preemptive Scheduling in Overloaded Systems

Authors:
Marek Chrobak;Leah Epstein;John Noga;Jiri Sgall;Rob van Stee;Tomás Tichý;Nodari Vakhania
Affiliations:
-;-;-;-;-;-;-
Venue:
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Year:
2002

Citing 9
Cited 8

On the competitiveness of on-line real-time task scheduling

Real-Time Systems
Dover: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems

SIAM Journal on Computing
Online computation and competitive analysis

Online computation and competitive analysis
Trade-offs between speed and processor in hard-deadline scheduling

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
On the speed requirement for optimal deadline scheduling in overloaded systems

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
On-Line Scheduling with Tight Deadlines

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Competitive Online Scheduling with Level of Service

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art

Preemptive scheduling in overloaded systems

Journal of Computer and System Sciences
Non-migratory online deadline scheduling on multiprocessors

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling Search Procedures

Journal of Scheduling
Performance guarantee for EDF under overload

Journal of Algorithms
Scheduling search procedures: The wheel of fortune

Journal of Scheduling
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling

Theoretical Computer Science
Improved competitive algorithms for online scheduling with partial job values

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.02

Visualization

Abstract

The following scheduling problem is studied: We are given a set of tasks withrelease 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 non-completed 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.