Coarse grain parallelization of evolutionary algorithms on GPGPU cards with EASEA

  • Authors:
  • Ogier Maitre;Laurent A. Baumes;Nicolas Lachiche;Avelino Corma;Pierre Collet

  • Affiliations:
  • Université de Strasbourg, Strasbourg, France;Universidad Politecnica de Valencia (UPV-CSIC), Valencia, Spain;Université de Strasbourg, Strasbourg, France;Universidad Politecnica de Valencia (UPV-CSIC), Valencia, Spain;Université de Strasbourg, Strasbourg, France

  • Venue:
  • Proceedings of the 11th Annual conference on Genetic and evolutionary computation
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper presents a straightforward implementation of a standard evolutionary algorithm that evaluates its population in parallel on a GPGPU card. Tests done on a benchmark and a real world problem using an old NVidia 8800GTX card and a newer but not top of the range GTX260 card show a roughly 30x (resp. 100x) speedup for the whole algorithm compared to the same algorithm running on a standard 3.6GHz PC. Knowing that much faster hardware is already available, this opens new horizons to evolutionary computation, as search spaces can now be explored 2 or 3 orders of magnitude faster, depending on the number of used GPGPU cards. Since these cards remains very difficult to program, the knowhow has been integrated into the old EASEA language, that can now output code for GPGPU (-cuda option).