Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/3778
Título: Job phasing aware preemption deferral
Autor: Marinho, José
Petters, Stefan M.
Data: 2011
Editora: IEEE
Relatório da Série N.º: Embedded and Ubiquitous Computing (EUC);
Resumo: Preemptions account for a non-negligible overhead during system execution. There has been substantial amount of research on estimating the delay incurred due to the loss of working sets in the processor state (caches, registers, TLBs) and some on avoiding preemptions, or limiting the preemption cost. We present an algorithm to reduce preemptions by further delaying the start of execution of high priority tasks in fixed priority scheduling. Our approaches take advantage of the floating non-preemptive regions model and exploit the fact that, during the schedule, the relative task phasing will differ from the worst-case scenario in terms of admissible preemption deferral. Furthermore, approximations to reduce the complexity of the proposed approach are presented. Substantial set of experiments demonstrate that the approach and approximations improve over existing work, in particular for the case of high utilisation systems, where savings of up to 22% on the number of preemption are attained.
Peer review: yes
URI: http://hdl.handle.net/10400.22/3778
ISBN: 978-1-4577-1822-9
Versão do Editor: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6104517
Aparece nas colecções:ISEP – CISTER – Artigos

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

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

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