Abstract
This paper addresses two parallelization techniques used for evolutionary computation. We study the grid enabled evolutionary computation model, and the differences between the coevolution and the space decomposition based parallel evolutionary algorithm are described in detail. We propose master-slave mode and equality mode used for SPMD program implementation. In this paper, we also discuss the advantages and drawbacks of these two parallel computing model. Through comparing the solution precision attained between parallel evolutionary algorithms, we stress the excellence of space decomposition based evolutionary algorithms. Finally, successful experiment results are given to show the better optimization efficiency achieved through the parallel evolutionary algorithms.
Supported by “SEC E-Institute: Shanghai High Institutions Grid project”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Daniel Sabban: Bringing Grid Web Services Together, Globus World, San Francisco, CA, (2004)
Enrique Alba, Marco Tomassini: Parallelism and Evolutionary Algorithms. IEEE Transactions On Evolutionary Computation, 6, 443–462 (2002)
G. Allen, T. Dramlitsch, Ian. Foster et al: Efficient Execution in Heterogeneous Distributed Computing Environments with Catus and Globus, Proc. SC01 (SC2001), Denver. (2001)
Hu X, Eberhart R: Adaptive particle swarm optimization: detection and reponse to dynamic system. IEEE Congress on Evolutionary Computation, Honolulu, Hawaii (2002)
Ian Forster: Grid-Enabled MPI: Message Passing in Heterogeneous Distributed Computing Systems, Supercomputing 98 (1998)
Mark Baker, Rajkumar Buyya, Domenico Laforenza: The Grid: A Survey on Global Efforts in Grid Computing, School of Computer Science, Univ. of Portsmouth (2001)
Zong-Ben Xu, Kwong-Sak Leung, Yong Liang: Efficiency speed-up strategies for evolutionary computation:fundamentals and fast-GAs. Applied Mathematics and Computation, 142, 341–388 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lei, Y., Luo, J. (2005). Scalable SPMD Algorithm of Evolutionary Computation. In: Zhang, W., Tong, W., Chen, Z., Glowinski, R. (eds) Current Trends in High Performance Computing and Its Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27912-1_42
Download citation
DOI: https://doi.org/10.1007/3-540-27912-1_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25785-1
Online ISBN: 978-3-540-27912-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)