Multiprocessors are now commonplace for efficiently achieving high computational power, even in embedded systems. A considerable research effort is being addressed to schedulability analysis of global scheduling in symmetric multiprocessor platforms (SMP), where there is a global queue of ready tasks, and preemption and migration are allowed. In many soft real-time applications (as e.g. multimedia and telecommunication) a bounded lateness is often tolerated. Unfortunately, when considering priority-driven scheduling of periodic/sporadic tasks, previous results only focused on guaranteeing all deadlines, and provided worst-case utilization bounds that are lower than the maximum available computational power. In particular, until now, the existence of an upper bound on the lateness of soft real-time tasks for a fully utilized SMP was still an open problem. In this paper we do solve this problem by providing an upper bound to the lateness of periodic/sporadic tasks - with relative deadlines equal to periods/minimum inter-arrival times - scheduled by EDF on a SMP, under the only assumption that the total utilization is no higher than the total system capacity

An Upper Bound to the Lateness of Soft Real-time Tasks Scheduled by EDF on Multiprocessors / Valente, Paolo; Giuseppe, Lipari. - STAMPA. - 26(2005), pp. 320-330. ((Intervento presentato al convegno Real-Time Systems Symposium, 2005. RTSS 2005. 26th IEEE International tenutosi a Miami nel Dicembre 2005.

An Upper Bound to the Lateness of Soft Real-time Tasks Scheduled by EDF on Multiprocessors

VALENTE, Paolo;
2005

Abstract

Multiprocessors are now commonplace for efficiently achieving high computational power, even in embedded systems. A considerable research effort is being addressed to schedulability analysis of global scheduling in symmetric multiprocessor platforms (SMP), where there is a global queue of ready tasks, and preemption and migration are allowed. In many soft real-time applications (as e.g. multimedia and telecommunication) a bounded lateness is often tolerated. Unfortunately, when considering priority-driven scheduling of periodic/sporadic tasks, previous results only focused on guaranteeing all deadlines, and provided worst-case utilization bounds that are lower than the maximum available computational power. In particular, until now, the existence of an upper bound on the lateness of soft real-time tasks for a fully utilized SMP was still an open problem. In this paper we do solve this problem by providing an upper bound to the lateness of periodic/sporadic tasks - with relative deadlines equal to periods/minimum inter-arrival times - scheduled by EDF on a SMP, under the only assumption that the total utilization is no higher than the total system capacity
Real-Time Systems Symposium, 2005. RTSS 2005. 26th IEEE International
Miami
Dicembre 2005
26
320
330
Valente, Paolo; Giuseppe, Lipari
An Upper Bound to the Lateness of Soft Real-time Tasks Scheduled by EDF on Multiprocessors / Valente, Paolo; Giuseppe, Lipari. - STAMPA. - 26(2005), pp. 320-330. ((Intervento presentato al convegno Real-Time Systems Symposium, 2005. RTSS 2005. 26th IEEE International tenutosi a Miami nel Dicembre 2005.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Caricamento 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: http://hdl.handle.net/11380/587904
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 30
  • ???jsp.display-item.citation.isi??? 15
social impact