Schedulability analysis of real-time systems requires the knowledge of the worst-case execution time (WCET) of each computational activity. A precise estimation of such a task parameter is quite difficult to achieve, because execution times depend on many factors, including the task structure, the system architecture details, operating system features and so on. While some of these features are not under our control, selecting a proper scheduling algorithm can reduce the runtime overhead and make the WCETs smaller and more predictable. In particular, since task execution times can be significantly affected by preemptions, a number of scheduling methods have been proposed in the real-time literature to limit preemption during task execution. In this paper, we provide a comprehensive overview of the possible scheduling approaches that can be used to contain preemptions and present a comparative study aimed at evaluating their impact on task execution times.

Comparative evaluation of limited preemptive methods / G., Yao; G., Buttazzo; Bertogna, Marko. - STAMPA. - 0:(2010), pp. 1-8. (Intervento presentato al convegno 15th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2010 tenutosi a Bilbao, esp nel September 13-16, 2010) [10.1109/ETFA.2010.5641199].

Comparative evaluation of limited preemptive methods

BERTOGNA, Marko
2010

Abstract

Schedulability analysis of real-time systems requires the knowledge of the worst-case execution time (WCET) of each computational activity. A precise estimation of such a task parameter is quite difficult to achieve, because execution times depend on many factors, including the task structure, the system architecture details, operating system features and so on. While some of these features are not under our control, selecting a proper scheduling algorithm can reduce the runtime overhead and make the WCETs smaller and more predictable. In particular, since task execution times can be significantly affected by preemptions, a number of scheduling methods have been proposed in the real-time literature to limit preemption during task execution. In this paper, we provide a comprehensive overview of the possible scheduling approaches that can be used to contain preemptions and present a comparative study aimed at evaluating their impact on task execution times.
2010
15th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2010
Bilbao, esp
September 13-16, 2010
0
1
8
G., Yao; G., Buttazzo; Bertogna, Marko
Comparative evaluation of limited preemptive methods / G., Yao; G., Buttazzo; Bertogna, Marko. - STAMPA. - 0:(2010), pp. 1-8. (Intervento presentato al convegno 15th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2010 tenutosi a Bilbao, esp nel September 13-16, 2010) [10.1109/ETFA.2010.5641199].
File in questo prodotto:
File Dimensione Formato  
ETFA10.pdf

Accesso riservato

Tipologia: Versione dell'autore revisionata e accettata per la pubblicazione
Dimensione 575.93 kB
Formato Adobe PDF
575.93 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/701110
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 21
  • ???jsp.display-item.citation.isi??? 5
social impact