A cluster-based strategy for scheduling task on heterogeneous processors

  • C. Boeres UFF
  • J. V. Filho UFF
  • V. E. F. Rebello UFF

Resumo


Efficient task scheduling is fundamental for parallel applications to achieve good performance on distributed systems. While extensive work exists for scheduling tasks on homogeneous processors, fewer algorithms exist for the more common problem of scheduling in heterogeneous processor environments. In this paper, we propose coupling a replication-based clustering heuristic for homogeneous processors, with a mechanism to map the generated clusters to the heterogeneous environment. Experimental results show that this strategy compares favourably in terms of the makespan with traditional list scheduling approaches to this problem, particularly when communication costs are high.
Palavras-chave: Processor scheduling, Clustering algorithms, Scheduling algorithm, Optimal scheduling, Costs, Delay, Computational efficiency, Concurrent computing, Distributed computing, Parallel processing
Publicado
27/10/2004
BOERES, C.; V. FILHO, J.; REBELLO, V. E. F.. A cluster-based strategy for scheduling task on heterogeneous processors. In: INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING (SBAC-PAD), 16. , 2004, Foz do Iguaçu/PR. Anais [...]. Porto Alegre: Sociedade Brasileira de Computação, 2004 . p. 214-221.