An exact schedulability test for global FP using state space pruning
Artem Burmyakov, Enrico Bini, Eduardo Tovar · 2015
We propose an exact schedulability test for sporadic real-time tasks with constrained deadlines, scheduled by Global Fixed Priority (GFP). Our test is faster and less memory consuming than other state-of-the-art exact tests. We achieve such results by employing a set of techniques that cut down the state space of the analysis, which extend the prior work by Bonifaci and Marchetti-Spaccamela. Our test is implemented in C++ code, and it is publicly available.