| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 236.38 KB | Adobe PDF |
Autores
Orientador(es)
Resumo(s)
Consider global fixed-priority preemptive multiprocessor
scheduling of implicit-deadline sporadic tasks. I conjecture
that the utilization bound of SM-US(√2−1) is √2-1.
