The following pages link to MOCA (Q15168):
Displayed 17 items.
- Extra processors versus future information in optimal deadline scheduling (Q706313) (← links)
- Competitive analysis of online real-time scheduling algorithms under hard energy constraint (Q993512) (← links)
- Online interval scheduling: Randomized and multiprocessor cases (Q1029703) (← links)
- Scheduling parallel tasks with individual deadlines (Q1285585) (← links)
- Competitive deadline scheduling via additional or faster processors (Q2464388) (← links)
- An improved randomized on-line algorithm for a weighted interval selection problem (Q2464426) (← links)
- (Q2768377) (← links)
- Bounding the Power of Preemption in Randomized Scheduling (Q4210081) (← links)
- (Q4252341) (← links)
- The Power of Migration in Multiprocessor Scheduling of Real-Time Systems (Q4507362) (← links)
- IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS (Q4667921) (← links)
- Performance guarantee for edf under overload (Q4815773) (← links)
- (Q4952665) (← links)
- Energy Efficient Deadline Scheduling in Two Processor Systems (Q5387780) (← links)
- (Q5874511) (← links)
- A general framework for handling commitment in online throughput maximization (Q5918914) (← links)
- Optimal time-critical scheduling via resource augmentation (Q5957573) (← links)