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
On-line scheduling of jobs with fixed start and end times
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Approximation algorithms for NP-hard problems
Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling Algorithms
Developments from a June 1996 seminar on Online algorithms: the state of the art
Speed is as powerful as clairvoyance [scheduling problems]
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
On the speed requirement for optimal deadline scheduling in overloaded systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
On-Line Scheduling with Tight Deadlines
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Resource Augmentation in Load Balancing
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Minimizing the Maximum Starting Time On-line
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Optimal online algorithms on two hierarchical machines with resource augmentation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On-line scheduling on a single machine: maximizing the number of early jobs
Operations Research Letters
| Hi-index | 0.00 |
We consider the problem of maximizing the number of jobs completed by their deadline in an online single processor system where the jobs are preemptable and have release times. So in the standard three field scheduling notation, this is the online version of the problem 1 | ri ;pmtn | Σ (1 - Ui). We give a constant competitive randomized algorithm for this problem. It is known that no constant competitive deterministic algorithm exists for this problem. This is the first time that this phenomenon, the randomized competitive ratio is constant in spite of the fact that the deterministic competitive ratio is nonconstant, has been demonstrated to occur in a natural online problem. This result is also a first step toward determining how an online scheduler can use additional processors in a real-time setting to achieve competitiveness.