Provably good task assignment on heterogeneous multiprocessor platforms for a restricted case but with a stronger adversary

• Autor(a) principal: Raravi, Gurulingesh
• Data de Publicação: 2011
• Outros Autores: Andersson, Björn, Bletsas, Konstantinos
• Tipo de documento: Relatório
• Idioma: eng
• Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
• Texto Completo: http://hdl.handle.net/10400.22/3757
• topic: Heterogeneous multiprocessor; Task migrations; Real-time scheduling

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We consider a restricted case where the maximum utilization of any task on any processor in the system is no greater than one. 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 for this restricted case but for a stronger adversary. We show 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.