Assigning real-time tasks on heterogeneous multiprocessors with two types of pr...

• Autor(es): Andersson, Björn ; Bletsas, Konstantinos
• Data: 2009
• Identificador Persistente: http://hdl.handle.net/10400.22/3856
• Origem: Repositório Científico do Instituto Politécnico do Porto
• Tipo de Documento: Relatório
• Idioma: Inglês

Descrição

Consider the problem of scheduling a set of implicitdeadline sporadic tasks on a heterogeneous multiprocessor so as to meet all deadlines. Tasks cannot migrate and the platform is restricted in that each processor is either of type-1 or type-2 (with each task characterized by a different speed of execution upon each type of processor). We present an algorithm for this problem with a timecomplexity of O(n·m), where n is the number of tasks and m is the number of processors. It offers the guarantee that if a task set can be scheduled by any non-migrative algorithm to meet deadlines then our algorithm meets deadlines as well if given processors twice as fast. Although this result is proven for only a restricted heterogeneous multiprocessor, we consider it significant for being the first realtime scheduling algorithm to use a low-complexity binpacking approach to schedule tasks on a heterogeneous multiprocessor with provably good performance.