This paper considers the scheduling of parallel real-time tasks with arbitrary-deadlines. Each job of a parallel task is described as a directed acyclic graph (DAG). In contrast to prior work in this area, where decomposition-based scheduling algorithms are proposed based on the DAG-structure and inter-task interference is analyzed as self-suspending behavior, this paper generalizes the federated scheduling approach. We propose a reservation-based algorithm, called reservation-based federated scheduling, that dominates federated scheduling. We provide general constraints for the design of such systems and prove that reservation-based federated scheduling has a constant speedup factor with respect to any optimal DAG task scheduler. Furthermore, the presented algorithm can be used in conjunction with any scheduler and scheduling analysis suitable for ordinary arbitrary-deadline sporadic task sets, i.e., without parallelism.
@article{arxiv.1712.05040,
title = {Reservation-Based Federated Scheduling for Parallel Real-Time Tasks},
author = {Niklas Ueter and Georg von der Brüggen and Jian-Jia Chen and Jing Li and Kunal Agrawal},
journal= {arXiv preprint arXiv:1712.05040},
year = {2017}
}