IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS
From MaRDI portal
Recommendations
- A 2.79 competitive on-line algorithm for two processor real-time systems with uniform value density
- On the competitiveness of on-line real-time task scheduling
- scientific article; zbMATH DE number 1303561
- On-line scheduling with tight deadlines.
- Competitive deadline scheduling via additional or faster processors
Cites work
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
- Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error
- Minimizing Maximum Weighted Error for Imprecise Computation Tasks
- Minimizing mean flow time with error constraint
- Minimizing the number of late tasks with error constraint
- Minimizing the weighted number of tardy task units
- MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
- Scheduling imprecise computation tasks with \(0/1\)-constraint
Cited in
(3)
This page was built for publication: IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4667921)