A carregar...
Publicação
Provably good multiprocessor scheduling with resource sharing
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 308.14 KB | Adobe PDF |
Autores
Orientador(es)
Resumo(s)
We present a 12(1 + 3R/(4m)) competitive algorithm for scheduling
implicit-deadline sporadic tasks on a platform comprising m processors, where a task
may request one of R shared resources.
Descrição
Palavras-chave
Multiprocessor scheduling with resource sharing Competitive ratio for multiprocessor resource sharing
Contexto Educativo
Citação
Editora
Springer