Competitive deadline scheduling via additional or faster processors

Authors:
Chiu-Yuen Koo;Tak-Wah Lam;Tsuen-Wan Ngan;Kar-Keung To
Affiliations:
Department of Computer Science, University of Hong Kong, Hong Kong;Department of Computer Science, University of Hong Kong, Hong Kong;Department of Computer Science, University of Hong Kong, Hong Kong;Department of Computer Science, University of Hong Kong, Hong Kong
Venue:
Journal of Scheduling - Special issue: On-line algorithm part I
Year:
2003

Citing 15
Cited 1

On-line scheduling in the presence of overload

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On the competitiveness of on-line real-time task scheduling

Real-Time Systems
MOCA: a multiprocessor on-line competitive algorithm for real-time system scheduling

Theoretical Computer Science - Special issue on dependable parallel computing
Dover: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems

SIAM Journal on Computing
Optimal time-critical scheduling via resource augmentation (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Online computation and competitive analysis

Online computation and competitive analysis
Scheduling in the dark

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Trade-offs between speed and processor in hard-deadline scheduling

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Applying extra-resource analysis to load balancing

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
Performance guarantee for online deadline scheduling in the presence of overload

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms

Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Speed is More Powerful than Claivoyance

SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art
Overload Tolerance for Single-Processor Workloads

RTAS '98 Proceedings of the Fourth IEEE Real-Time Technology and Applications Symposium

Preemptive scheduling in overloaded systems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper studies on-line scheduling in a single-processor system that allows preemption. The aim is to maximize the total value of jobs completed by their deadlines. It is known that if the on-line scheduler is given a processor faster (say, two times faster) than the off-line scheduler, then there exists an on-line algorithm called SLACKER that can achieve an O(1) competitive ratio. In this paper, we show that using additional unit-speed processors instead of a faster processor is a possible but not cost effective way to achieve an O(1) competitive ratio. Specifically, we find that-zTheta;(log k) unit-speed processors are required, where k is the importance ratio. Another contribution of this paper is an improved analysis of the competitiveness of SLACKER; this new analysis enables us to show that SLACKER, when exteaded to multi-processor systems, can still guarantee an O(1) competitive ratio.