A schedulable utilization bound for the multiprocessor EPDF Pfair algorithm
From MaRDI portal
Publication:2479889
Recommendations
- Improved conditions for bounded tardiness underepdfpfair multiprocessor scheduling
- Utilization bounds for EDF scheduling on real-time multiprocessor systems
- An \(\mathsf{EDF}\)-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems
- Optimal rate-based scheduling on multiprocessors
- Tardiness bounds under global EDF scheduling on a multiprocessor
Cites work
- Feasibility problems for recurring tasks on one processor
- Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
- On a Real-Time Scheduling Problem
- Optimal rate-based scheduling on multiprocessors
- Priority-driven scheduling of periodic task systems on multiprocessors
- Proportionate progress: A notion of fairness in resource allocation
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Cited in
(7)- Utilization bounds for EDF scheduling on real-time multiprocessor systems
- Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
- Task reweighting under global scheduling on multiprocessors
- Optimal rate-based scheduling on multiprocessors
- {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines
- Improved conditions for bounded tardiness underepdfpfair multiprocessor scheduling
- Schedulability issues for EDZL scheduling on real-time multiprocessor systems
This page was built for publication: A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2479889)