A carregar...
Publicação
Sporadic multiprocessor scheduling with few preemptions
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 334.76 KB | Adobe PDF |
Orientador(es)
Resumo(s)
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).