In this paper a limited pre-emptive global fixed task priority scheduling policy for multiprocessors is presented. This scheduling policy is a generalization of global fully pre-emptive and non-pre-emptive fixed task priority policies for platforms with at least two homogeneous processors. The scheduling protocol devised is such that a job can only be blocked at most once by a body of lower priority non-pre-emptive workload. The presented policy dominates both fully pre-emptive and fully non-pre-emptive with respect to schedulability. A sufficient schedulability test is presented for this policy. Several approaches to estimate the blocking generated by lower priority non-pre-emptive regions are presented. As a last contribution it is experimentally shown that, on the average case, the number of pre-emptions observed in a schedule are drastically reduced in comparison to global fully pre-emptive scheduling.

Limited Pre-emptive Global Fixed Task Priority / Marinho, Jose; Nelis, Vincent; Petters, Stefan M.; Bertogna, Marko; Davis, Robert I.. - STAMPA. - (2013), pp. 182-191. (Intervento presentato al convegno 34th IEEE Real-Time Systems Symposium (RTSS 2013) tenutosi a Vancouver, Canada nel December 2013) [10.1109/RTSS.2013.26].

Limited Pre-emptive Global Fixed Task Priority

BERTOGNA, Marko;
2013

Abstract

In this paper a limited pre-emptive global fixed task priority scheduling policy for multiprocessors is presented. This scheduling policy is a generalization of global fully pre-emptive and non-pre-emptive fixed task priority policies for platforms with at least two homogeneous processors. The scheduling protocol devised is such that a job can only be blocked at most once by a body of lower priority non-pre-emptive workload. The presented policy dominates both fully pre-emptive and fully non-pre-emptive with respect to schedulability. A sufficient schedulability test is presented for this policy. Several approaches to estimate the blocking generated by lower priority non-pre-emptive regions are presented. As a last contribution it is experimentally shown that, on the average case, the number of pre-emptions observed in a schedule are drastically reduced in comparison to global fully pre-emptive scheduling.
2013
34th IEEE Real-Time Systems Symposium (RTSS 2013)
Vancouver, Canada
December 2013
182
191
Marinho, Jose; Nelis, Vincent; Petters, Stefan M.; Bertogna, Marko; Davis, Robert I.
Limited Pre-emptive Global Fixed Task Priority / Marinho, Jose; Nelis, Vincent; Petters, Stefan M.; Bertogna, Marko; Davis, Robert I.. - STAMPA. - (2013), pp. 182-191. (Intervento presentato al convegno 34th IEEE Real-Time Systems Symposium (RTSS 2013) tenutosi a Vancouver, Canada nel December 2013) [10.1109/RTSS.2013.26].
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

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