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
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
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
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Speed is More Powerful than Claivoyance
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
Speed is as powerful as clairvoyance [scheduling problems]
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Overload Tolerance for Single-Processor Workloads
RTAS '98 Proceedings of the Fourth IEEE Real-Time Technology and Applications Symposium
Extra processors versus future information in optimal deadline scheduling
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Online deadline scheduling on faster machines
Information Processing Letters
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
On-line scheduling with tight deadlines
Theoretical Computer Science - Mathematical foundations of computer science
Non-migratory online deadline scheduling on multiprocessors
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Competitive deadline scheduling via additional or faster processors
Journal of Scheduling - Special issue: On-line algorithm part I
Improved competitive algorithms for online scheduling with partial job values
Theoretical Computer Science - Special papers from: COCOON 2003
Improved competitive algorithms for online scheduling with partial job values
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Optimal buffer management via resource augmentation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.00 |
Earliest deadline first (EDF) is a widely-used online algorithm for scheduling jobs with deadlines in real-time systems. Yet, existing results on the performance guarantee of EDF are limited to underloaded systems [6,12,14]. This paper initiates the study of EDF for overloaded systems, attaining similar performance guarantees as in the underloaded setting. Specifically, we show that EDF with a simple form of admission control is optimal for scheduling on both uniprocessor and multiprocessors when moderately faster processors are available (our analysis actually admits a tradeoff between speed and extra processors). This is the first result attaining optimality under overload. Another contribution of this paper is an improved analysis of the competitiveness for weighted deadline scheduling.