Seminar Series 2015 - Artem Burmyakov
An Exact Schedulability Test for Global FP Using State Space PruningCISTER, Porto, Portugal
ABSTRACT:
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.
EVENT PHOTOS:
At CISTER's Facebook page
DOWNLOAD:
PDF Presentation (900KB)
CISTER's main roles:
Artem Burmyakov