Pages that link to "Item:Q4834383"
From MaRDI portal
The following pages link to $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems (Q4834383):
Displayed 34 items.
- Online scheduling with preemption or non-completion penalties (Q398912) (← links)
- Energy efficient scheduling for real-time embedded systems with QoS guarantee (Q535734) (← links)
- Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics (Q553339) (← links)
- Online time-constrained scheduling in linear and ring networks (Q616984) (← links)
- A technique for adaptive scheduling of soft real-time tasks (Q813149) (← links)
- Efficient job scheduling algorithms with multi-type contentions (Q813335) (← links)
- Dynamic real-time scheduling of firm periodic tasks with hard and soft aperiodic tasks (Q853601) (← links)
- Lower bounds on online deadline scheduling with preemption penalties (Q975450) (← links)
- Competitive analysis of online real-time scheduling algorithms under hard energy constraint (Q993512) (← links)
- Online interval scheduling: Randomized and multiprocessor cases (Q1029703) (← links)
- On the competitiveness of on-line real-time task scheduling (Q1206445) (← links)
- MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling (Q1330422) (← links)
- Online real-time preemptive scheduling of jobs with deadlines on multiple machines (Q1348736) (← links)
- A 2.79 competitive on-line algorithm for two processor real-time systems with uniform value density (Q1370302) (← links)
- On-line scheduling with tight deadlines. (Q1401244) (← links)
- Preemptive scheduling in overloaded systems. (Q1401985) (← links)
- Preemptive scheduling of equal-length jobs to maximize weighted throughput. (Q1426730) (← links)
- Automated competitive analysis of real-time scheduling with graph games (Q1698779) (← links)
- A tighter extra-resource analysis of online deadline scheduling (Q1781800) (← links)
- Online scheduling with partial job values: does timesharing or randomization help? (Q1879362) (← links)
- Improved competitive algorithms for online scheduling with partial job values (Q1884846) (← links)
- Improved randomized online scheduling of intervals and jobs (Q2254495) (← links)
- Scheduling with deadlines and buffer management with processing requirements (Q2408172) (← links)
- Buffer Management for Packets with Processing Times (Q3452767) (← links)
- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs (Q3602829) (← links)
- Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics (Q3652225) (← links)
- IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS (Q4667921) (← links)
- Dynamic scheduling for real‐time distributed systems using ant colony optimization (Q4932965) (← links)
- Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization (Q5130573) (← links)
- ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO (Q5462125) (← links)
- On the Competitiveness of Online Real-Time Scheduling with Rate of Progress Guarantees (Q5696914) (← links)
- Optimally Handling Commitment Issues in Online Throughput Maximization (Q5874511) (← links)
- A general framework for handling commitment in online throughput maximization (Q5918914) (← links)
- Online Throughput Maximization on Unrelated Machines: Commitment is No Burden (Q6075745) (← links)