While the earliest deadline first algorithm is known to be optimal as a uniprocessor scheduling policy, the implementation comes at a cost in terms of complexity. Fixed task-priority algorithms on the other hand have lower complexity but higher likelihood of task sets being declared unschedulable, when compared to earliest deadline first (EDF). Various attempts have been undertaken to increase the chances of proving a task set schedulable with similar low complexity. In some cases, this was achieved, by modifying applications to limit preemptions, at the cost of flexibility. In this work we explore several variants of a concept to limit interference by locking down the ready queue at certain instances. The aim is to increase the prospects of schedulability of a given task system, without compromising on complexity or flexibility, when compared to the regular fixed task-priority algorithm. As a final contribution a new preemption threshold assignment algorithm is provided which is less complex and more straightforward than the previous method available in the literature.

Extending Fixed Task-Priority Schedulability by Interference Limitation / José, Marinho; Stefan M., Petters; Bertogna, Marko. - STAMPA. - (2012), pp. 191-200. (Intervento presentato al convegno 20th International Conference on Real-Time and Network Systems (RTNS 2012) tenutosi a Pont a Mousson, France nel November 08 - 09, 2012) [10.1145/2392987.2393012].

Extending Fixed Task-Priority Schedulability by Interference Limitation

BERTOGNA, Marko
2012

Abstract

While the earliest deadline first algorithm is known to be optimal as a uniprocessor scheduling policy, the implementation comes at a cost in terms of complexity. Fixed task-priority algorithms on the other hand have lower complexity but higher likelihood of task sets being declared unschedulable, when compared to earliest deadline first (EDF). Various attempts have been undertaken to increase the chances of proving a task set schedulable with similar low complexity. In some cases, this was achieved, by modifying applications to limit preemptions, at the cost of flexibility. In this work we explore several variants of a concept to limit interference by locking down the ready queue at certain instances. The aim is to increase the prospects of schedulability of a given task system, without compromising on complexity or flexibility, when compared to the regular fixed task-priority algorithm. As a final contribution a new preemption threshold assignment algorithm is provided which is less complex and more straightforward than the previous method available in the literature.
2012
20th International Conference on Real-Time and Network Systems (RTNS 2012)
Pont a Mousson, France
November 08 - 09, 2012
191
200
José, Marinho; Stefan M., Petters; Bertogna, Marko
Extending Fixed Task-Priority Schedulability by Interference Limitation / José, Marinho; Stefan M., Petters; Bertogna, Marko. - STAMPA. - (2012), pp. 191-200. (Intervento presentato al convegno 20th International Conference on Real-Time and Network Systems (RTNS 2012) tenutosi a Pont a Mousson, France nel November 08 - 09, 2012) [10.1145/2392987.2393012].
File in questo prodotto:
File Dimensione Formato  
RTNS12.pdf

Accesso riservato

Tipologia: Versione dell'autore revisionata e accettata per la pubblicazione
Dimensione 473.85 kB
Formato Adobe PDF
473.85 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
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/856496
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? ND
social impact