Heterogeneous computing and parallel genetic algorithms

  • Authors:

  • Enrique Alba;Antonio J. Nebro;José M. Troya

  • Affiliations:

  • Dpto. de Lenguajes y Ciencias de la Computación, Universidad de Málaga, E.T.S.I. en Informática, Campus de Teatinos, Málaga 29071, Spain;Dpto. de Lenguajes y Ciencias de la Computación, Universidad de Málaga, E.T.S.I. en Informática, Campus de Teatinos, Málaga 29071, Spain;Dpto. de Lenguajes y Ciencias de la Computación, Universidad de Málaga, E.T.S.I. en Informática, Campus de Teatinos, Málaga 29071, Spain

  • Venue:
  • Journal of Parallel and Distributed Computing - Problems in parallel and distributed computing: Solutions based on evolutionary paradigms
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper analyzes some technical and practical issues concerning the heterogeneous execution of parallel genetic algorithms (PGAs). In order to cope with a plethora of different operating systems, security restrictions, and other problems associated to multi-platform execution, we use Java to implement a distributed PGA model. The distributed PGA runs at the same time on different machines linked by different kinds of communication networks. This algorithm benefits from the computational resources offered by modern LANs and by Internet, therefore allowing researchers to solve more difficult problems by using a large set of available machines. We analyze the way in which such heterogeneous systems affect the genetic search for two problems. Our conclusion is that super-linear performance can be achieved not only in homogeneous but also in heterogeneous clusters of machines. In addition, we study some special features of the running platforms for PGAs, and basically find out that heterogeneous computing can be as efficient or even more efficient than homogeneous computing for parallel heuristics.