Parallel Path Progression DAG Scheduling

08/25/2022
by   Niklas Ueter, et al.
0

To satisfy the increasing performance needs of modern cyber-physical systems, multiprocessor architectures are increasingly utilized. To efficiently exploit their potential parallelism in hard real-time systems, appropriate task models and scheduling algorithms that allow providing timing guarantees are required. Such scheduling algorithms and the corresponding worst-case response time analyses usually suffer from resource over-provisioning due to pessimistic analyses based on worst-case assumptions. Hence, scheduling algorithms and analysis with high resource efficiency are required. A prominent parallel task model is the directed-acyclic-graph (DAG) task model, where precedence constrained subjobs express parallelism. This paper studies the real-time scheduling problem of sporadic arbitrary-deadline DAG tasks. We propose a path parallel progression scheduling property with only two distinct subtask priorities, which allows to track the execution of a collection of paths simultaneously. This novel approach significantly improves the state-of-the-art response time analyses for parallel DAG tasks for highly parallel DAG structures. Two hierarchical scheduling algorithms are designed based on this property, extending the parallel path progression properties and improving the response time analysis for sporadic arbitrary-deadline DAG task sets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/26/2021

Response-Time Analysis and Optimization for Probabilistic Conditional Parallel DAG Tasks

Real-time systems increasingly use multicore processors in order to sati...
research
12/13/2017

Reservation-Based Federated Scheduling for Parallel Real-Time Tasks

This paper considers the scheduling of parallel real-time tasks with arb...
research
07/25/2023

Longer Is Shorter: Making Long Paths to Improve the Worst-Case Response Time of DAG Tasks

DAG (directed acyclic graph) tasks are widely used to model parallel rea...
research
05/25/2011

Scheduling of Hard Real-Time Multi-Thread Periodic Tasks

In this paper we study the scheduling of parallel and real-time recurren...
research
05/13/2019

Analysis of Global Fixed-Priority Scheduling for Generalized Sporadic DAG Tasks

We consider global fixed-priority (G-FP) scheduling of parallel tasks, i...
research
04/04/2018

Estimating Latencies of Task Sequences in Multi-Core Automotive ECUs

The computation of a cyber-physical system's reaction to a stimulus typi...
research
06/04/2014

Timing Analysis for DAG-based and GFP Scheduled Tasks

Modern embedded systems have made the transition from single-core to mul...

Please sign up or login with your details

Forgot password? Click here to reset