Burmyakov, ArtemBini, EnricoTovar, Eduardo2015-12-032015-12-032015http://hdl.handle.net/10400.22/7064Presented at 23rd International Conference on Real-Time Networks and Systems (RTNS 2015). 4 to 6, Nov, 2015, Main Track. Lille, France.We propose an exact schedulability test for sporadic realtime 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.engconference object10.1145/2834848.2834877