An Exact Schedulability Test for  Global FP Using State Space Pruning

Burmyakov, Artem; Bini, Enrico; Tovar, Eduardo

http://hdl.handle.net/10400.22/7064

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
COM_CISTER_2015.pdf		2.47 MB	Adobe PDF	Download

Send Feedback

Authors

Burmyakov, Artem

Bini, Enrico

Tovar, Eduardo

Abstract(s)

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.