A carregar...
Publicação
Multiprocessor scheduling with few preemptions
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 176.6 KB | Adobe PDF |
Autores
Orientador(es)
Resumo(s)
Consider the problem of scheduling a set of periodically arriving tasks on a multiprocessor with the goal
of meeting deadlines. Processors are identical and have the same speed. Tasks can be preempted and they
can migrate between processors. We propose an algorithm with a utilization bound of 66% and with few
preemptions. It can trade a higher utilization bound for more preemption and in doing so it has a utilization
bound of 100%.
Descrição
Palavras-chave
Contexto Educativo
Citação
Editora
IEEE