The question whether preemptive algorithms are better than nonpreemptive ones for scheduling a set of real-time tasks has been debated for a long time in the research community. In fact, especially under fixed priority systems, each approach has advantages and disadvantages, and no one dominates the other when both predictability and efficiency have to be taken into account in the system design. Recently, limited preemption models have been proposed as a viable alternative between the two extreme cases of fully preemptive and nonpreemptive scheduling. This paper presents a survey of the existing approaches for reducing preemptions and compares them under different metrics, providing both qualitative and quantitative performance evaluations.
Limited Preemptive Scheduling for Real-Time Systems. A Survey / Buttazzo, Giorgio C.; Bertogna, Marko; Yao, Gang. - In: IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS. - ISSN 1551-3203. - STAMPA. - 9(2013), pp. 3-15.
Data di pubblicazione: | 2013 |
Titolo: | Limited Preemptive Scheduling for Real-Time Systems. A Survey |
Autore/i: | Buttazzo, Giorgio C.; Bertogna, Marko; Yao, Gang |
Autore/i UNIMORE: | |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1109/TII.2012.2188805 |
Rivista: | |
Volume: | 9 |
Pagina iniziale: | 3 |
Pagina finale: | 15 |
Codice identificativo ISI: | WOS:000312839600001 |
Codice identificativo Scopus: | 2-s2.0-84871766409 |
Citazione: | Limited Preemptive Scheduling for Real-Time Systems. A Survey / Buttazzo, Giorgio C.; Bertogna, Marko; Yao, Gang. - In: IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS. - ISSN 1551-3203. - STAMPA. - 9(2013), pp. 3-15. |
Tipologia | Articolo su rivista |
File in questo prodotto:
File | Descrizione | Tipologia | |
---|---|---|---|
TII12.pdf | N/A | Richiedi una copia |

I documenti presenti in Iris Unimore sono rilasciati con licenza Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia, salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris