Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/4015
Título: Exact admission-control for integrated aperiodic and periodic tasks
Autor: Andersson, Björn
Ekelin, Cecilia
Palavras-chave: Real-time systems
Schedulability analysis
Operating systems
Online scheduling
Earliest-deadline- rst
AVL tree
Lazy evaluation
Data: 2007
Editora: Elsevier
Relatório da Série N.º: Journal of Computer and System Sciences; Vol. 73, Issue 2
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.
Peer review: yes
URI: http://hdl.handle.net/10400.22/4015
Versão do Editor: http://www.sciencedirect.com/science/article/pii/S0022000006000493
Aparece nas colecções:ISEP – CISTER – Artigos

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
ART_BjornAndersson_2006_CISTER.pdf574,11 kBAdobe PDFVer/Abrir

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.