Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/3898
Título: LLF schedulability analysis on multiprocessor platforms
Autor: Lee, Jinkyu
Easwaran, Arvind
Shin, Insik
Data: 2010
Editora: IEEE
Relatório da Série N.º: Real-Time Systems Symposium;
Resumo: LLF (Least Laxity First) scheduling, which assigns a higher priority to a task with smaller laxity, has been known as an optimal preemptive scheduling algorithm on a single processor platform. However, its characteristics upon multiprocessor platforms have been little studied until now. Orthogonally, it has remained open how to efficiently schedule general task systems, including constrained deadline task systems, upon multiprocessors. Recent studies have introduced zero laxity (ZL) policy, which assigns a higher priority to a task with zero laxity, as a promising scheduling approach for such systems (e.g., EDZL). Towards understanding the importance of laxity in multiprocessor scheduling, this paper investigates the characteristics of ZL policy and presents the first ZL schedulability test for any work-conserving scheduling algorithm that employs this policy. It then investigates the characteristics of LLF scheduling, which also employs the ZL policy, and derives the first LLF-specific schedulability test on multiprocessors. It is shown that the proposed LLF test dominates the ZL test as well as the state-of-art EDZL test.
Peer review: yes
URI: http://hdl.handle.net/10400.22/3898
ISBN: 978-0-7695-4298-0
ISSN: 1052-8725
Versão do Editor: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5702215
Aparece nas colecções:ISEP – CISTER – Comunicações em eventos científicos

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
COM_JinkyuLee_2010_CISTER.pdf381,67 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.