Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/3742
Título: A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary
Autor: Raravi, Gurulingesh
Andersson, Björn
Bletsas, Konstantinos
Palavras-chave: Heterogeneous multiprocessor
Task migrations
Real-time scheduling
Data: 2011
Editora: IPP-Hurray Group
Resumo: Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee but for a stronger adversary.We conjecture that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast. We illustrate this with an example.
Peer review: no
URI: http://hdl.handle.net/10400.22/3742
Versão do Editor: http://www.cister.isep.ipp.pt/docs/
Aparece nas colecções:ISEP – CISTER – Relatórios

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
REL_GurulingeshRaravi_2011_CISTER.pdf263,75 kBAdobe PDFVer/Abrir

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

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