Online deadline scheduling on faster machines

Authors:
Jae-Hoon Kim;Kyung-Yong Chwa
Affiliations:
Department of Electrical Engineering & Computer Science, Korea Advanced Institute of Science and Technology, Taejon 305-701, Republic of Korea;Department of Electrical Engineering & Computer Science, Korea Advanced Institute of Science and Technology, Taejon 305-701, Republic of Korea
Venue:
Information Processing Letters
Year:
2003

Citing 8
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
Optimal time-critical scheduling via resource augmentation (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Online interval scheduling

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Patience is a virtue: the effect of slack on competitiveness for admission control

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Improvements in throughout maximization for real-time scheduling

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
On-line Scheduling with Hard Deadlines (Extended Abstract)

WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures

Quantified Score

Hi-index	0.89

Visualization

Abstract

Online deadline scheduling is to determine which jobs are accepted or rejected, where jobs have the deadline by which they must finish their processing and they arrive in the online fashion. The slack of a job is the gap between its arrival time and the last time when it can first be scheduled to meet its deadline. The job instance is given such that the slack of each job is at least k times its processing time, where k is called patience. In this paper, online algorithms have faster machines than the adversary. We investigate the speed of machines on which the online algorithms can achieve the optimality and parametrize them by the patience.