Cited in
(17)- Online interval scheduling: Randomized and multiprocessor cases
- Bounding the Power of Preemption in Randomized Scheduling
- scientific article; zbMATH DE number 1445347 (Why is no real title available?)
- Competitive analysis of online real-time scheduling algorithms under hard energy constraint
- Performance guarantee for edf under overload
- A general framework for handling commitment in online throughput maximization
- Competitive deadline scheduling via additional or faster processors
- Scheduling parallel tasks with individual deadlines
- Energy Efficient Deadline Scheduling in Two Processor Systems
- The Power of Migration in Multiprocessor Scheduling of Real-Time Systems
- scientific article; zbMATH DE number 1305455 (Why is no real title available?)
- Optimally Handling Commitment Issues in Online Throughput Maximization
- Optimal time-critical scheduling via resource augmentation
- IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS
- Extra processors versus future information in optimal deadline scheduling
- An improved randomized on-line algorithm for a weighted interval selection problem
- Performance guarantee for online deadline scheduling in the presence of overload
This page was built for software: MOCA
