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.

An exact schedulability test for global FP using state space pruning

BINI, Enrico;
2015-01-01

Abstract

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.
2015
23rd International Conference on Real-Time Networks and Systems, RTNS 2015
Francia
2015
ACM International Conference Proceeding Series
Association for Computing Machinery
225
234
9781450335911
9781450335911
http://portal.acm.org/
Human-Computer Interaction; Computer Networks and Communications; 1707; Software
Burmyakov, Artem; Bini, Enrico; Tovar, Eduardo
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2318/1615484
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 14
  • ???jsp.display-item.citation.isi??? 10
social impact