Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/3935
Título: Scheduling arbitrary-deadline sporadic task systems on multiprocessors
Autor: Andersson, Björn
Bletsas, Konstantinos
Baruah, Sanjoy
Data: 2008
Editora: IEEE
Relatório da Série N.º: Real-Time Systems Symposium;
Resumo: A new algorithm is proposed for scheduling preemptible arbitrary-deadline sporadic task systems upon multiprocessor platforms, with interprocessor migration permitted. This algorithm is based on a task-splitting approach - while most tasks are entirely assigned to specific processors, a few tasks (fewer than the number of processors) may be split across two processors. This algorithm can be used for two distinct purposes: for actually scheduling specific sporadic task systems, and for feasibility analysis. Simulation- based evaluation indicates that this algorithm offers a significant improvement on the ability to schedule arbitrary- deadline sporadic task systems as compared to the contemporary state-of-art. With regard to feasibility analysis, the new algorithm is proved to offer superior performance guarantees in comparison to prior feasibility tests.
Peer review: yes
URI: http://hdl.handle.net/10400.22/3935
ISBN: 978-0-7695-3477-0
ISSN: 1052-8725
Versão do Editor: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=4700452
Aparece nas colecções:ISEP – CISTER – Artigos

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
ART_BjornAndersson_2008_CISTER.pdf256,18 kBAdobe PDFVer/Abrir    Acesso Restrito. Solicitar cópia ao autor!

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote 

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