A survey on real-time DAG scheduling, revisiting the Global-Partitioned Infinity War
From MaRDI portal
Publication:6488823
DOI10.1007/S11241-023-09403-3MaRDI QIDQ6488823
Unnamed Author, Marko Bertogna, Unnamed Author
Publication date: 24 October 2023
Published in: Real-Time Systems (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
- Stretching algorithm for global scheduling of real-time DAG tasks
- Schedulability analysis of DAG tasks with arbitrary deadlines under global fixed-priority scheduling
- The non-preemptive scheduling of periodic tasks upon multiprocessors
- Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
- NP-complete scheduling problems
- Energy-Efficient Multi-Core Scheduling for Real-Time DAG Tasks
- DAG-Fluid: A Real-Time Scheduling Algorithm for DAGs
- The HPC-DAG Task Model for Heterogeneous Real-Time Systems
- Multiprocessor Scheduling for Real-Time Systems
- Bounds on Multiprocessing Timing Anomalies
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
This page was built for publication: A survey on real-time DAG scheduling, revisiting the Global-Partitioned Infinity War