Extra processors versus future information in optimal deadline scheduling

Authors:
Chiu-Yuen Koo;Tak-Wah Lam;Tsuen-Wan Ngan;Kar-Keung To
Affiliations:
University of Maryland, College Park, MD;University of Hong Kong, Hong Kong;Rice University, Houston, TX;University of Hong Kong, Hong Kong
Venue:
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Year:
2002

Citing 16
Cited 6

On-line scheduling in the presence of overload

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
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
Eliminating migration in multi-processor scheduling

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
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
The Power of Migration in Multiprocessor Scheduling of Real-Time Systems

SIAM Journal on Computing
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

Online deadline scheduling: multiple machines and randomization

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Improved competitive algorithms for online scheduling with partial job values

Theoretical Computer Science - Special papers from: COCOON 2003
Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved competitive algorithms for online scheduling with partial job values

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Maximizing the throughput of multiple machines on-line

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Optimal buffer management via resource augmentation

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is concerned with the extra-resource analysis of online scheduling algorithms. In particular, it studies how to make use of multiple processors to counteract the lack of future information in online deadline scheduling. Our results extend the previous work that are primarily based on using a faster processor to obtain a performance guarantee. The challenge arises from the fact that jobs are sequential in nature and cannot be executed on more than one processor at the same time. Thus, a faster processor can speed up a job while multiple unit-speed processors cannot help.