A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Semi-Federated Scheduling of Parallel Real-Time Tasks on Multiprocessors
[article]
2017
arXiv
pre-print
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
arXiv:1705.03245v1
fatcat:6nk66zeicrghdosub3uofupwva