Una Heurística Cooperativa para resolver el Problema de Scheduling en un Cluster con Procesadores Homogéneos

Resumen

This article presents a cooperative heuristic based on evolutionary algorithms to solve the scheduling of a parallel application running on a cluster with homogeneous processors. The aim is to find optimal solutions of the scheduling in a prudent time. In order to achieve this objective we present the results obtained with a parallel implementation of this cooperative genetic algorithm. The results in terms of execution time of this parallel genetic algorithm are excellent when considering that the scheduling problem is a NP-hard problem.