Often hard real-time systems require results that are produced on time despite the occurrence of processor failures. This paper considers a distributed system where tasks are periodic and each task occurs in multiple copies which are periodically synchronized in order to handle failures. The problem of preemptively scheduling a set of such tasks is discussed where every occurrence of a task has to be completely executed before the next occurrence of the same task. First, a static scheduling algorithm is proposed which uses periodic checkpoints to tolerate processor failures. Then, the performance of the algorithm is substancially improved employing a mixed strategy which constructs a schedule where high frequency tasks are duplicated, and low frequency tasks are periodically checkpointed. The performance of the solution proposed is evaluated in terms of the minimum achievable processor utilization due to the useful computation of the tasks. Moreover, analytical and simulation studies are used to reveal interesting trade-offs associated with the scheduling algorithm. In particular, if high frequency tasks are less than 70 percent of the total number of tasks then the mixed strategy yields a higher processor utilization than the task duplication scheme.
Increasing processor utilization in hard-real-time systems with checkpoints / Bertossi, A; Bonometto, M; Mancini, Luigi Vincenzo. - In: REAL-TIME SYSTEMS. - ISSN 0922-6443. - STAMPA. - 9:1(1995), pp. 5-29.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||Increasing processor utilization in hard-real-time systems with checkpoints|
|Data di pubblicazione:||1995|
|Citazione:||Increasing processor utilization in hard-real-time systems with checkpoints / Bertossi, A; Bonometto, M; Mancini, Luigi Vincenzo. - In: REAL-TIME SYSTEMS. - ISSN 0922-6443. - STAMPA. - 9:1(1995), pp. 5-29.|
|Appartiene alla tipologia:||01a Articolo in rivista|