A carregar...
Publicação
Capacity sharing and stealing in dynamic server-based real-time systems
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 301.06 KB | Adobe PDF |
Orientador(es)
Resumo(s)
This paper proposes a dynamic scheduler that supports
the coexistence of guaranteed and non-guaranteed bandwidth
servers to efficiently handle soft-tasks’ overloads by
making additional capacity available from two sources: (i)
residual capacity allocated but unused when jobs complete
in less than their budgeted execution time; (ii) stealing capacity
from inactive non-isolated servers used to schedule
best-effort jobs. The effectiveness of the proposed approach
in reducing the mean tardiness of periodic jobs is demonstrated
through extensive simulations. The achieved results
become even more significant when tasks’ computation
times have a large variance.
Descrição
Palavras-chave
Contexto Educativo
Citação
Editora
IEEE