Scheduling Multiprocessor Tasks with Genetic Algorithms

  • Authors:
  • Ricardo C. Corrêa;Afonso Ferreira;Pascal Rebreyend

  • Affiliations:
  • Univ. Federal do Ceará, Fortaleza, Brazil;CNRS-13S-INRIA, Sophia Antipolis, France;CNRS URA, Lyon, France

  • Venue:
  • IEEE Transactions on Parallel and Distributed Systems
  • Year:
  • 1999

Quantified Score

Hi-index 0.02

Visualization

Abstract

In the multiprocessor scheduling problem, a givenprogram is to be scheduled in a given multiprocessor system such that the program's execution time is minimized. This problem being very hard to solve exactly, many heuristic methods for finding a suboptimal schedule exist. We propose a new combined approach, where a genetic algorithm is improved with the introduction of some knowledge about the scheduling problem represented by the use of a list heuristic in the crossover and mutation genetic operations. This knowledge-augmented genetic approach is empirically compared with a 驴pure驴 genetic algorithm and with a 驴pure驴 list heuristic, both from the literature. Results of the experiments carried out with synthetic instances of the scheduling problem show that our knowledge-augmented algorithm produces much better results in terms of quality of solutions, although being slower in terms of execution time.