A carregar...
Publicação
Competitive analysis of partitioned scheduling on uniform multiprocessors
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 205.18 KB | Adobe PDF |
Autores
Orientador(es)
Resumo(s)
Consider the problem of scheduling a set of sporadically
arriving tasks on a uniform multiprocessor with the goal of
meeting deadlines. A processor p has the speed Sp. Tasks
can be preempted but they cannot migrate between processors.
We propose an algorithm which can schedule all task
sets that any other possible algorithm can schedule assuming
that our algorithm is given processors that are three
times faster.
Descrição
Palavras-chave
Contexto Educativo
Citação
Editora
IEEE