{\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines
From MaRDI portal
Publication:613790
Recommendations
- T-L plane-based real-time scheduling for homogeneous multiprocessors
- {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
- An optimal multiprocessor real-time scheduling algorithm
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
- LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems
Cites work
- scientific article; zbMATH DE number 1559529 (Why is no real title available?)
- A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm
- EDZL scheduling analysis
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
- Proportionate progress: A notion of fairness in resource allocation
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Cited in
(5)- Laxity dynamics and LLF schedulability analysis on multiprocessor platforms
- T-L plane-based real-time scheduling for homogeneous multiprocessors
- Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems
- An optimal boundary fair scheduling
- Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
This page was built for publication: {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613790)