A conjecture about provably good task assignment on heterogeneous multiprocesso...

• Autor(es): Raravi, Gurulingesh ; Andersson, Björn ; Bletsas, Konstantinos
• Data: 2011
• Identificador Persistente: http://hdl.handle.net/10400.22/3742
• Origem: Repositório Científico do Instituto Politécnico do Porto
• Assunto(s): Heterogeneous multiprocessor; Task migrations; Real-time scheduling
• Tipo de Documento: Relatório
• Idioma: Inglês

Descrição

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.