Author(s):
Andersson, Björn 
; Bletsas, Konstantinos
Date: 2008
Persistent ID: http://hdl.handle.net/10400.22/3936
Origin: Repositório Científico do Instituto Politécnico do Porto
Document details
Sporadic multiprocessor scheduling with few preemptions
Description
Consider the problem of scheduling n sporadic tasks so as to meet deadlines on m identical processors. A task is characterised by its minimum interarrival time and its worst-case execution time. Tasks are preemptible and may migrate between processors. We propose an algorithm with limited migration, configurable for a utilisation bound of 88% with few preemptions (and arbitrarily close to 100% with more preemptions).
Consider the problem of scheduling n sporadic tasks so as to meet deadlines on m identical processors. A task is characterised by its minimum interarrival time and its worst-case execution time. Tasks are preemptible and may migrate between processors. We propose an algorithm with limited migration, configurable for a utilisation bound of 88% with few preemptions (and arbitrarily close to 100% with more preemptions).
Document Type
Conference Object
Language English
Language English
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||