An Exact Schedulability Test for Global FP Using State Space Pruning
Ref: CISTER-TR-150503 Publication Date: 4 to 6, Nov, 2015
An Exact Schedulability Test for Global FP Using State Space Pruning
Ref: CISTER-TR-150503 Publication Date: 4 to 6, Nov, 2015Abstract:
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 mem- ory 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.
Artem Burmyakov
Enrico Bini
Eduardo TovarDocument:
View
DownloadAdditional Files:
23rd International Conference on Real-Time Networks and Systems (RTNS 2015), Main Track.
Lille, France.
Notes: The software tool for the paper titled "An Exact Schedulability Test for Global FP Using State Space Pruning"
Record Date: 15, May, 2015
Short links for this page: www.cister.isep.pt/docs/cister_tr_150503 www.cister.isep.pt/docs/1092