Genetic algorithms (GAs) are stochastic search methods that have been successfully applied in many search, optimization, and machine learning problems. Their parallel counterpart (PGA, parallel genetic algorithms) offers many advantages over the traditional GAs, such as speed, ability to search on a larger search space, and less likely to run into a local optimum. With the advent of Grid computing, the computational power that can be deliver to the applications have substantially increased, and so PGAs can potentially benefit from this new Grid technologies. However, because of the dynamic and heterogeneous nature of Grid environments, the implementation and execution of PGAs in a Grid involve challenging issues. This paper discusses the distribution of a PGA across the Grid using the DRMAA standard API and the Grid Way framework. The efficiency and reliability of this schema to solve the One Max problem is analyzed in a globus-based research testbed. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Herrera, J., Huedo, E., Montero, R. S., & Llorente, I. M. (2005). A Grid-oriented genetic algorithm. In Lecture Notes in Computer Science (Vol. 3470, pp. 315–322). Springer Verlag. https://doi.org/10.1007/11508380_33
Mendeley helps you to discover research relevant for your work.