Fast parallelization of differential evolution algorithm using MapReduce

  • Authors:
  • Chi Zhou

  • Affiliations:
  • Motorola Applied Research Center, Schaumburg, IL, USA

  • Venue:
  • Proceedings of the 12th annual conference on Genetic and evolutionary computation
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

MapReduce is a promising programming model for developing distributed applications due to its superb simplicity, scalability and fault tolerance. This paper demonstrates how to apply MapReduce and the open source Hadoop framework for a quick and easy parallelization of the Differential Evolution algorithm. Instead of parallelizing the whole evolution process, our simple solution is to only apply the MR model to the fitness evaluation part, which usually consumes most of the running time. Two alternative approaches are investigated, i.e., population based and data based. Experimental results reveal that even though the population based approach is a better way, the extra cost of Hadoop DFS I/O operations and system bookkeeping overhead significantly reduces the benefits of parallelism.