A parallel micro evolutionary algorithm for heterogeneous computing and grid scheduling

  • Authors:
  • Sergio Nesmachnow;Héctor Cancela;Enrique Alba

  • Affiliations:
  • Universidad de la República, Herrera y Reissig 565, Montevideo, Uruguay;Universidad de la República, Herrera y Reissig 565, Montevideo, Uruguay;Universidad de Málaga, Spain

  • Venue:
  • Applied Soft Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

This work presents a novel parallel micro evolutionary algorithm for scheduling tasks in distributed heterogeneous computing and grid environments. The scheduling problem in heterogeneous environments is NP-hard, so a significant effort has been made in order to develop an efficient method to provide good schedules in reduced execution times. The parallel micro evolutionary algorithm is implemented using MALLBA, a general-purpose library for combinatorial optimization. Efficient numerical results are reported in the experimental analysis performed on both well-known problem instances and large instances that model medium-sized grid environments. The comparative study of traditional methods and evolutionary algorithms shows that the parallel micro evolutionary algorithm achieves a high problem solving efficacy, outperforming previous results already reported in the related literature, and also showing a good scalability behavior when facing high dimension problem instances.