Exact admission-control for integrated aperiodic and periodic tasks
Autor(a) principal: | |
---|---|
Data de Publicação: | 2007 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10400.22/4015 |
Resumo: | 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. |
id |
RCAP_56549890d1fddd782071963af6fab2b8 |
---|---|
oai_identifier_str |
oai:recipp.ipp.pt:10400.22/4015 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Exact admission-control for integrated aperiodic and periodic tasksReal-time systemsSchedulability analysisOperating systemsOnline schedulingEarliest-deadline- rstAVL treeLazy evaluationAdmission 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.ElsevierRepositório Científico do Instituto Politécnico do PortoAndersson, BjörnEkelin, Cecilia2014-02-21T10:47:34Z20072007-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.22/4015eng10.1016/j.jcss.2006.04.001info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-03-13T12:43:52Zoai:recipp.ipp.pt:10400.22/4015Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:24:57.165653Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Exact admission-control for integrated aperiodic and periodic tasks |
title |
Exact admission-control for integrated aperiodic and periodic tasks |
spellingShingle |
Exact admission-control for integrated aperiodic and periodic tasks Andersson, Björn Real-time systems Schedulability analysis Operating systems Online scheduling Earliest-deadline- rst AVL tree Lazy evaluation |
title_short |
Exact admission-control for integrated aperiodic and periodic tasks |
title_full |
Exact admission-control for integrated aperiodic and periodic tasks |
title_fullStr |
Exact admission-control for integrated aperiodic and periodic tasks |
title_full_unstemmed |
Exact admission-control for integrated aperiodic and periodic tasks |
title_sort |
Exact admission-control for integrated aperiodic and periodic tasks |
author |
Andersson, Björn |
author_facet |
Andersson, Björn Ekelin, Cecilia |
author_role |
author |
author2 |
Ekelin, Cecilia |
author2_role |
author |
dc.contributor.none.fl_str_mv |
Repositório Científico do Instituto Politécnico do Porto |
dc.contributor.author.fl_str_mv |
Andersson, Björn Ekelin, Cecilia |
dc.subject.por.fl_str_mv |
Real-time systems Schedulability analysis Operating systems Online scheduling Earliest-deadline- rst AVL tree Lazy evaluation |
topic |
Real-time systems Schedulability analysis Operating systems Online scheduling Earliest-deadline- rst AVL tree Lazy evaluation |
description |
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. |
publishDate |
2007 |
dc.date.none.fl_str_mv |
2007 2007-01-01T00:00:00Z 2014-02-21T10:47:34Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10400.22/4015 |
url |
http://hdl.handle.net/10400.22/4015 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1016/j.jcss.2006.04.001 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Elsevier |
publisher.none.fl_str_mv |
Elsevier |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799131342357659648 |