A carregar...
Publicação
The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 133.4 KB | Adobe PDF |
Autores
Orientador(es)
Resumo(s)
This paper studies static-priority preemptive
scheduling on a multiprocessor using partitioned scheduling.
We propose a new scheduling algorithm and prove that if the
proposed algorithm is used and if less than 50% of the capacity is
requested then all deadlines are met. It is known that for every
static-priority multiprocessor scheduling algorithm, there is a
task set that misses a deadline although the requested capacity
is arbitrary close to 50%.
Descrição
Palavras-chave
Real-time scheduling Partitioning Bin-packing algorithms Static-priority scheduling Preemptive scheduling Multiprocessors
Contexto Educativo
Citação
Editora
IOS Press