MRPGA: an extension of MapReduce for parallelizing genetic algorithms
C Jin, C Vecchiola, R Buyya - 2008 IEEE Fourth International …, 2008 - ieeexplore.ieee.org
C Jin, C Vecchiola, R Buyya
2008 IEEE Fourth International Conference on eScience, 2008•ieeexplore.ieee.orgThe MapReduce programming model allows users to easily develop distributed applications
in data centers. However, many applications cannot be exactly expressed with MapReduce
due to their specific characteristics. For instance, genetic algorithms (GAs) naturally fit into
an iterative style. That does not follow the two phase pattern of MapReduce. This paper
presents an extension to the MapReduce model featuring a hierarchical reduction phase.
This model is called MRPGA (MapReduce for parallel GAs), which can automatically …
in data centers. However, many applications cannot be exactly expressed with MapReduce
due to their specific characteristics. For instance, genetic algorithms (GAs) naturally fit into
an iterative style. That does not follow the two phase pattern of MapReduce. This paper
presents an extension to the MapReduce model featuring a hierarchical reduction phase.
This model is called MRPGA (MapReduce for parallel GAs), which can automatically …
The MapReduce programming model allows users to easily develop distributed applications in data centers. However, many applications cannot be exactly expressed with MapReduce due to their specific characteristics. For instance, genetic algorithms (GAs) naturally fit into an iterative style. That does not follow the two phase pattern of MapReduce. This paper presents an extension to the MapReduce model featuring a hierarchical reduction phase. This model is called MRPGA (MapReduce for parallel GAs), which can automatically parallelize GAs. We describe the design and implementation of the extended MapReduce model on a .NET-based enterprise grid system in detail. The evaluation of this model with its runtime system is presented using example applications.
ieeexplore.ieee.org