{\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
From MaRDI portal
Publication:436211
DOI10.1007/s11241-011-9130-0zbMath1243.68106OpenAlexW2037468202MaRDI QIDQ436211
Ian Pye, Caitlin Sadowski, Shelby Funk, Greg Levin, Scott A. Brandt
Publication date: 30 July 2012
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-011-9130-0
Related Items (10)
Isolation scheduling on multicores: model and scheduling approaches ⋮ Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems ⋮ Multi-rate fluid scheduling of mixed-criticality systems on multiprocessors ⋮ Energy-efficient thermal-aware multiprocessor scheduling for real-time tasks using TCPN ⋮ Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors ⋮ An optimal boundary fair scheduling algorithm for multiprocessor real-time systems ⋮ Laxity dynamics and LLF schedulability analysis on multiprocessor platforms ⋮ Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach ⋮ An optimal boundary fair scheduling ⋮ Cluster scheduling for real-time systems: utilization bounds and run-time overhead
Cites Work
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
- A new algorithm for scheduling periodic, real-time tasks
- An optimal multiprocessor real-time scheduling algorithm
- Proportionate progress: A notion of fairness in resource allocation
- Scheduling with Deadlines and Loss Functions
- A survey of hard real-time scheduling for multiprocessor systems
- On a Real-Time Scheduling Problem
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Optimal time-critical scheduling via resource augmentation
This page was built for publication: {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
