Parallel divide-and-evolve: experiments with OpenMP on a multicore machine
Thales Research & Technology , Palaiseau, France
Proceedings of the 13th annual conference on Genetic and evolutionary computation, GECCO ’11, 2011
@article{candan2011parallel,
title={Parallel Divide-and-Evolve: Experiments with OpenMP on a Multicore Machine},
author={Candan, C. and Dr{‘e}o, J. and Sav{‘e}ant, P. and Vidal, V.},
year={2011}
}
Multicore machines are becoming a standard way to speed up the system performance. After having instantiated the evolutionary metaheuristic DAEX with the forward search YAHSP planner, we investigate on the global parallelism approach, which exploits the intrinsic parallelism of the individual evaluation. This paper describes a parallel shared-memory version of the DAEYAHSP planning system using the OpenMP directive-based API. The parallelization scheme applies at a high level of abstraction and thus can be used by any evolutionary algorithm implemented with the Evolving Objects framework. The proof of concept is validated on a 48-core machine with two planning tasks extracted from the last international planning competition. Experiments show significant speedups with an increasing number of cores. This preliminary work opens an avenue for parallelizing any evolutionary algorithm developed with EO that would target multicore architectures.
September 19, 2011 by hgpu
