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

## TL;DR

This paper introduces a new workload bounding technique for global fixed-priority scheduling of DAG-based parallel tasks, leading to more accurate response-time analysis and improved scheduling guarantees.

## Contribution

It proposes a novel optimization-based workload bounding method that enhances response-time analysis for generalized DAG tasks under G-FP scheduling.

## Key findings

- The new technique provides tighter upper bounds on interfering workload.
- Response-time analysis is improved over existing methods.
- The approach is applicable directly to generalized DAG task models.

## Abstract

We consider global fixed-priority (G-FP) scheduling of parallel tasks, in which each task is represented as a directed acyclic graph (DAG). We summarize and highlight limitations of the state-of-the-art analyses for G-FP and propose a novel technique for bounding interfering workload, which can be applied directly to generalized DAG tasks. Our technique works by constructing optimization problems for which the optimal solution values serve as safe and tight upper bounds for interfering workloads. Using the proposed workload bounding technique, we derive a response-time analysis and show that it improves upon state-of-the-art analysis techniques for G-FP scheduling.