Using a lag-balance property to tighten tardiness bounds for global EDF
From MaRDI portal
Publication:284384
Recommendations
- Tardiness bounds under global EDF scheduling on a multiprocessor
- Generalized tardiness bounds for global multiprocessor scheduling
- A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF
- An analysis of global \texttt{EDF} schedulability for arbitrary-deadline sporadic task systems
- Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling
Cites work
- scientific article; zbMATH DE number 5497553 (Why is no real title available?)
- A survey of hard real-time scheduling for multiprocessor systems
- Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling
- Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
- Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
- Priority-driven scheduling of periodic task systems on multiprocessors
- Proportionate progress: A notion of fairness in resource allocation
- Tardiness bounds under global EDF scheduling on a multiprocessor
Cited in
(5)- Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling
- A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF
- Tardiness bounds under global EDF scheduling on a multiprocessor
- Tight Tardiness Bounds for Pseudo-Harmonic Tasks Under Global-EDF-Like Schedulers
- Generalized tardiness bounds for global multiprocessor scheduling
This page was built for publication: Using a lag-balance property to tighten tardiness bounds for global EDF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284384)
