An exact schedulability test for global FP using state space pruning

Autor:	Eduardo Tovar, Artem Burmyakov, Enrico Bini
Rok vydání:	2015
Předmět:	Computer Networks and Communications Computer science business.industry Human-Computer Interaction 1707 Software Parallel computing Test (assessment) Set (abstract data type) Code (cryptography) State space Pruning (decision trees) business
Zdroj:	RTNS
DOI:	10.1145/2834848.2834877
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0892a9c223b569c515001203302ffd7c https://doi.org/10.1145/2834848.2834877 Zobrazit plný text záznamu