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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Real-time systems Ročník 55; číslo 2; s. 349 - 386
Hlavní autoři:	Leoncini, Mauro, Montangero, Manuela, Valente, Paolo
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 15.04.2019 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!