# Semi-Federated Scheduling of Parallel Real-Time Tasks on Multiprocessors

arXiv: https://arxiv.org/abs/1705.03245 · HTML: https://mlsanity.com/paper/1705.03245/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 9 May 2017.

## Built on by (most cited first, 2 of 2)

- [RED: A Systematic Real-Time Scheduling Approach for Robotic Environmental Dynamics](https://mlsanity.com/paper/2308.15368/) (2023)
- [Strict Partitioning for Sporadic Rigid Gang Tasks](https://mlsanity.com/paper/2403.10726/) (2024)

## Abstract (arXiv)

Federated scheduling is a promising approach to schedule parallel real-time tasks on multi-cores, where each heavy task exclusively executes on a number of dedicated processors, while light tasks are treated as sequential sporadic tasks and share the remaining processors. However, federated scheduling suffers resource waste since a heavy task with processing capacity requirement x + ε (where x is an integer and 0 < ε < 1) needs x + 1 dedicated processors. In the extreme case, almost half of the processing capacity is wasted. In this paper we propose the semi-federate scheduling approach, which only grants x dedicated processors to a heavy task with processing capacity requirement x + ε, and schedules the remaining ε part together with light tasks on shared processors. Experiments with randomly generated task sets show the semi-federated scheduling approach significantly outperforms not only federated scheduling, but also all existing approaches for scheduling parallel real-time tasks on multi-cores.