A carregar...
Publicação
Exact admission-control for integrated aperiodic and periodic tasks
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 574.11 KB | Adobe PDF |
Autores
Orientador(es)
Resumo(s)
Admission controllers are used to prevent overload in systems with dynamically arriving
tasks. Typically, these admission controllers are based on suÆcient (but not
necessary) capacity bounds in order to maintain a low computational complexity.
In this paper we present how exact admission-control for aperiodic tasks can be
eÆciently obtained. Our rst result is an admission controller for purely aperiodic
task sets where the test has the same runtime complexity as utilization-based tests.
Our second result is an extension of the previous controller for a baseload of periodic
tasks. The runtime complexity of this test is lower than for any known exact
admission-controller. In addition to presenting our main algorithm and evaluating
its performance, we also discuss some general issues concerning admission controllers
and their implementation.
Descrição
Palavras-chave
Real-time systems Schedulability analysis Operating systems Online scheduling Earliest-deadline- rst AVL tree Lazy evaluation
Contexto Educativo
Citação
Editora
Elsevier