Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/3849
Título: Multiprocessor real-time scheduling considering concurrency and urgency
Autor: Lee, Jinkyu
Easwaran, Arvind
Shin, Insik
Lee, Insup
Data: 2010
Editora: ACM
Relatório da Série N.º: ACM SIGBED Review - Special Issue on the Work-in-Progress (WIP); Vol. 7, Issue 1, Art. Nº 5
Resumo: It has been widely studied how to schedule real-time tasks on multiprocessor platforms. Several studies find optimal scheduling policies for implicit deadline task systems, but it is hard to understand how each policy utilizes the two important aspects of scheduling real-time tasks on multiprocessors:inter-job concurrency and job urgency. In this paper, we introduce a new scheduling policy that considers these two properties. We prove that the policy is optimal for the special case when the execution time of all tasks are equally one and deadlines are implicit, and observe that the policy is a new concept in that it is not an instance of Pfair or ERfair. It remains open to find a schedulability condition for general task systems under our scheduling policy.
Peer review: yes
URI: http://hdl.handle.net/10400.22/3849
Versão do Editor: http://dl.acm.org/citation.cfm?doid=1851166.1851173
Aparece nas colecções:ISEP – CISTER – Artigos

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