Schedulability analysis of DAG tasks with arbitrary deadlines under global fixed-priority scheduling
From MaRDI portal
Recommendations
- Interference-aware fixed-priority schedulability analysis on multiprocessors
- Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement
- Push forward: global fixed-priority scheduling of arbitrary-deadline sporadic task systems
- An analysis of global \texttt{EDF} schedulability for arbitrary-deadline sporadic task systems
- Stretching algorithm for global scheduling of real-time DAG tasks
Cites work
- scientific article; zbMATH DE number 1953316 (Why is no real title available?)
- Measuring the performance of schedulability tests
- Multi-core real-time scheduling for generalized parallel task models
- Parallel recognition and decomposition of two terminal series parallel graphs
- Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems
Cited in
(9)- Reduction-based schedulability analysis of distributed systems with cycles in the task graph
- Interference-aware fixed-priority schedulability analysis on multiprocessors
- Response-time analysis of limited-preemptive parallel DAG tasks under global scheduling
- Stretching algorithm for global scheduling of real-time DAG tasks
- Response Time Bounds for DAG Tasks with Arbitrary Intra-Task Priority Assignment
- Global EDF scheduling for parallel real-time tasks
- A survey on real-time DAG scheduling, revisiting the Global-Partitioned Infinity War
- Characterizations of parallel real-time workloads
- Response time analysis of typed DAG tasks for G-FP scheduling
This page was built for publication: Schedulability analysis of DAG tasks with arbitrary deadlines under global fixed-priority scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779441)
