A survey of real-time scheduling on multiprocessor systems
From MaRDI portal
Publication:2090220
DOI10.1007/978-981-16-7443-3_7OpenAlexW3211729016MaRDI QIDQ2090220
Xingwu Liu, Mengying Guo, Zhenyu Sun
Publication date: 24 October 2022
Full work available at URL: https://doi.org/10.1007/978-981-16-7443-3_7
Uses Software
Cites Work
- Unnamed Item
- Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems
- Federated scheduling admits no constant speedup factors for constrained-deadline DAG task systems
- Analysis techniques for supporting hard real-time sporadic gang task systems
- EDZL scheduling analysis
- Rate monotonic scheduling in hard real-time systems
- Proportionate progress: A notion of fairness in resource allocation
- Laxity dynamics and LLF schedulability analysis on multiprocessor platforms
- The partitioned dynamic-priority scheduling of sporadic task systems
- A survey of hard real-time scheduling for multiprocessor systems
- Mixed-Criticality Scheduling of Sporadic Task Systems
- Refinement of workload models for engine controllers by state space partitioning
- A Mathematical Model for Periodic Scheduling Problems
- On a Real-Time Scheduling Problem
- Some simple scheduling algorithms
- New strategies for assigning real-time tasks to multiprocessor systems
- Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems
- GEDF Tardiness: Open Problems Involving Uniform Multiprocessors and Affinity Masks Resolved
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
This page was built for publication: A survey of real-time scheduling on multiprocessor systems
