Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
From MaRDI portal
Publication:656084
DOI10.1007/S11241-011-9114-0zbMath1230.68049OpenAlexW2026699559MaRDI QIDQ656084
Björn Andersson, Konstantinos Bletsas
Publication date: 26 January 2012
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-011-9114-0
Related Items (8)
Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems ⋮ CPU scheduling and memory management for interactive real-time applications ⋮ Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound ⋮ CPMD-mindful task assignment for NPS-F ⋮ Unified overhead-aware schedulability analysis for slot-based task-splitting ⋮ An optimal boundary fair scheduling ⋮ Cluster scheduling for real-time systems: utilization bounds and run-time overhead ⋮ Real-time application mapping for many-cores using a limited migrative model
Cites Work
- Unnamed Item
- Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
- Schedulability issues for EDZL scheduling on real-time multiprocessor systems
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
- Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
- Proportionate progress: A notion of fairness in resource allocation
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
This page was built for publication: Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
