Scaling Genetic Algorithms Using MapReduce

Genetic algorithms (GAs) are increasingly being applied to large scale problems. The traditional MPI-based parallel GAs require detailed knowledge about machine architecture. On the other hand, MapReduce is a powerful abstraction proposed by Google for making scalable and fault tolerant applications...

Full description

Saved in:
Bibliographic Details
Published in2009 Ninth International Conference on Intelligent Systems Design and Applications pp. 13 - 18
Main Authors Verma, A., Llora, X., Goldberg, D.E., Campbell, R.H.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2009
Subjects
Application software
Computer industry
Computer science
Concurrent computing
Evolutionary computation
Fault tolerance
Genetic algorithms
Intelligent systems
Large-scale systems
MapReduce
Scalability
Online AccessGet full text

Cover

More Information
Summary:Genetic algorithms (GAs) are increasingly being applied to large scale problems. The traditional MPI-based parallel GAs require detailed knowledge about machine architecture. On the other hand, MapReduce is a powerful abstraction proposed by Google for making scalable and fault tolerant applications. In this paper, we show how genetic algorithms can be modeled into the MapReduce model. We describe the algorithm design and implementation of GAs on Hadoop, an open source implementation of MapReduce. Our experiments demonstrate the convergence and scalability up to 10 5 variable problems. Adding more resources would enable us to solve even larger problems without any changes in the algorithms and implementation since we do not introduce any performance bottlenecks.
ISBN:1424447356
9781424447350
ISSN:2164-7143
DOI:10.1109/ISDA.2009.181