On-line scheduling with tight deadlines

Authors:
Chiu-Yuen Koo;Tak-Wah Lam;Tsuen-Wan Ngan;Kunihiko Sadakane;Kar-Keung To
Affiliations:
Department of Computer Science, University of Maryland, College Park, MD;Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong;Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong;Graduate School of Information Sciences, Tohoku University, Sendai 980-8579, Japan;Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong
Venue:
Theoretical Computer Science - Mathematical foundations of computer science
Year:
2003

Citing 14
Cited 2

Multiprocessor Online Scheduling of Hard-Real-Time Tasks

IEEE Transactions on Software Engineering
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
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
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
On the speed requirement for optimal deadline scheduling in overloaded systems

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
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

Mechanism design for online real-time scheduling

EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Improved online scheduling in maximizing throughput of equal length jobs

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is concerned with the on-line problem of scheduling jobs with tight deadlines in a uni-processor system. It has been known for long that in such a setting, no on-line algorithm is 1-competitive (i.e., optimal) in the sense of matching the optimal off-line algorithm on the total value of jobs that meet the deadlines; indeed, no algorithm can be better than k-competitive, where k is the importance ratio of the jobs. Recent work, however, reveals that the competitive ratio can be improved to a constant if the on-line scheduler is equipped with a processor O(1) times faster (J. ACM 47(4) (2000) 617), and further to one when using a processor O(logk) times faster (Proc. 12th Ann. ACM-SIAM Symp. on Discrete Algorithms, 2001, p. 755). This paper presents a new on-line algorithm for scheduling jobs with tight deadlines and shows that it is 1-competitive when using a processor that is only O(1) times faster.