A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF

In this paper we present a parallel exact algorithm to compute an upper bound to tardiness of preemptive global EDF (G-EDF) schedulers, named harmonic bound , which has been proved to be up to 30% tighter than previously proposed bounds. Tightness is a crucial property of tardiness bounds: a too loo...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Real-time systems Jg. 55; H. 2; S. 349 - 386
Hauptverfasser:	Leoncini, Mauro, Montangero, Manuela, Valente, Paolo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 15.04.2019 Springer Nature B.V
Schlagworte:	Algorithms Communications Engineering Computer Science Computer Systems Organization and Communication Networks Control Mechatronics Networks Performance and Reliability Polynomials Preempting Robotics Special Purpose and Application-Based Systems Tightness Upper bounds Branch-and-bound Parallel algorithm Global EDF scheduler Tardiness
ISSN:	0922-6443, 1573-1383
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!