Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/3724
Título: Preemption delay analysis for floating non-preemptive region scheduling
Autor: Marinho, José
Nélis, Vincent
Petters, Stefan M.
Puaut, Isabelle
Data: 2012
Editora: IEEE
Relatório da Série N.º: Design, Automation & Test in Europe Conference & Exhibition (DATE);
Resumo: In real-time systems, there are two distinct trends for scheduling task sets on unicore systems: non-preemptive and preemptive scheduling. Non-preemptive scheduling is obviously not subject to any preemption delay but its schedulability may be quite poor, whereas fully preemptive scheduling is subject to preemption delay, but benefits from a higher flexibility in the scheduling decisions. The time-delay involved by task preemptions is a major source of pessimism in the analysis of the task Worst-Case Execution Time (WCET) in real-time systems. Preemptive scheduling policies including non-preemptive regions are a hybrid solution between non-preemptive and fully preemptive scheduling paradigms, which enables to conjugate both world's benefits. In this paper, we exploit the connection between the progression of a task in its operations, and the knowledge of the preemption delays as a function of its progression. The pessimism in the preemption delay estimation is then reduced in comparison to state of the art methods, due to the increase in information available in the analysis.
Peer review: yes
URI: http://hdl.handle.net/10400.22/3724
ISBN: 978-1-4577-2145-8
ISSN: 1530-1591
Versão do Editor: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6176520
Aparece nas colecções:ISEP – CISTER – Comunicações em eventos científicos

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
COM_JoseMarinho_2012_CISTER.pdf364,3 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.