An Exact Schedulability Test for  Global FP Using State Space Pruning

Burmyakov, Artem; Bini, Enrico; Tovar, Eduardo

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

Utilize este identificador para referenciar este registo.

Nome:	Descrição:	Tamanho:	Formato:
COM_CISTER_2015.pdf		2.47 MB	Adobe PDF	Ver/Abrir

Contacte-nos

Autores

Burmyakov, Artem

Bini, Enrico

Tovar, Eduardo

Resumo(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.

Descrição

Presented at 23rd International Conference on Real-Time Networks and Systems (RTNS 2015). 4 to 6, Nov, 2015, Main Track. Lille, France.

URI

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

Editora

ACM

DOI

10.1145/2834848.2834877

Coleções

ISEP – CISTER – Comunicações em eventos científicos

Métricas Alternativas

Ver registo completo