Autor(es):
Andersson, Björn 
; Bletsas, Konstantinos
Data: 2008
Identificador Persistente: http://hdl.handle.net/10400.22/3936
Origem: Repositório Científico do Instituto Politécnico do Porto
Detalhes do Documento
Sporadic multiprocessor scheduling with few preemptions
Descrição
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).
Tipo de Documento
Documento de conferência
Idioma Inglês
Idioma Inglês
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||