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
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
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 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
Maximizing Job Completions Online
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Preemptive Scheduling in Overloaded Systems
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Zeta: scheduling interactive services with partial execution
Proceedings of the Third ACM Symposium on Cloud Computing
| Hi-index | 0.00 |
This paper is concerned with the on-line problem of scheduling jobs with tight deadlines in a single-processor system.I t has been known for long that in such a setting, no on-line algorithm is optimal (or 1-competitive) 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 Ω(k)-competitive, where k is the importance ratio of the jobs. Recent work, however, reveals that the competitive ratio can be improved to O(1) if the on-line scheduler is equipped with a processor O(1) times faster [8]; furthermore, optimality can be achieved when using a processor O(log k) times faster [12].Th is paper presents a new on-line algorithm for scheduling jobs with tight deadlines, which can achieve optimality when using a processor that is only O(1) times faster.