Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/3792
Título: Maximizing contention-free executions in multiprocessor scheduling
Autor: Lee, Jinkyu
Easwaran, Arvind
Shin, Insik
Data: 2011
Editora: IEEE
Relatório da Série N.º: Real-Time and Embedded Technology and Applications Symposium (RTAS);
Resumo: It is widely assumed that scheduling real-time tasks becomes more difficult as their deadlines get shorter. With deadlines shorter, however, tasks potentially compete less with each other for processors, and this could produce more contention-free slots at which the number of competing tasks is smaller than or equal to the number of available processors. This paper presents a policy (called CF policy) that utilizes such contention-free slots effectively. This policy can be employed by any work-conserving, preemptive scheduling algorithm, and we show that any algorithm extended with this policy dominates the original algorithm in terms of schedulability. We also present improved schedulability tests for algorithms that employ this policy, based on the observation that interference from tasks is reduced when their executions are postponed to contention-free slots. Finally, using the properties of the CF policy, we derive a counter-intuitive claim that shortening of task deadlines can help improve schedulability of task systems. We present heuristics that effectively reduce task deadlines for better scheduability without performing any exhaustive search.
Peer review: yes
URI: http://hdl.handle.net/10400.22/3792
ISBN: 978-1-61284-326-1
ISSN: 1080-1812
Versão do Editor: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5767155
Aparece nas colecções:ISEP – CISTER – Artigos

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
ART_JinkyuLee_2011_CISTER.pdf385,73 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.