Timing Analysis for DAG-based and GFP Scheduled Tasks

2014/06/04 by José Marinho, Marinho, José, Stefan M. Petters +1
Computer Science · #Distributed #Embedded Systems Design Techniques #FOS: Computer and information sciences #Operating Systems (cs.OS) #Parallel #Parallel Computing and Optimization Techniques #Real-Time Systems Scheduling #and Cluster Computing (cs.DC)

paper · pdf · doi:10.48550/arxiv.1406.1133

openalex publication_date 2014/06/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Modern embedded systems have made the transition from single-core to multi-core architectures, providing performance improvement via parallelism rather than higher clock frequencies. DAGs are considered among the most generic task models in the real-time domain and are well suited to exploit this parallelism. In this paper we provide a schedulability test using response-time analysis exploiting exploring and bounding the self interference of a DAG task. Additionally we bound the interference a high priority task has on lower priority ones.

Related

• Bounding the Response Time of DAG Tasks Using Long Paths
• New Analysis Techniques for Supporting Hard Real-Time Sporadic DAG Task Systems on Multiprocessors
• A C-DAG task model for scheduling complex real-time tasks on heterogeneous platforms: preemption matters
• Response Time Bounds for Typed DAG Parallel Tasks on Heterogeneous Multi-cores
• Precise Schedulability Analysis for unfeasible to notify separately for comprehensive - EDF Scheduling of interrupted Hard Real-Time Tasks on the similar Multiprocessors