Bulk Synchronous Parallelisation of Genetic Programming

作者: Dimitris C. Dracopoulos , Simon Kent

DOI: 10.1007/3-540-62095-8_23

关键词:

摘要: A parallel implementation of Genetic Programming (GP) is described, using the Bulk Synchronous Parallel (BSP) model, as implemented by Oxford BSP library. Two approaches to GP are examined. The first based on global parallelisation while second implements island model for evolutionary algorithms. It shown that considerable speedup execution can be achieved and very suitable similar

参考文章(8)
Kenneth A. De Jong, Genetic Algorithms Are NOT Function Optimizers foundations of genetic algorithms. ,vol. 2, pp. 5- 17 ,(1993) , 10.1016/B978-0-08-094832-4.50006-4
L. Darrell Whitley, V. Scott Gordon, Serial and Parallel Genetic Algorithms as Function Optimizers international conference on genetic algorithms. pp. 177- 183 ,(1993)
JohnR. Koza, Genetic programming as a means for programming computers by natural selection Statistics and Computing. ,vol. 4, pp. 87- 112 ,(1994) , 10.1007/BF00175355
Leslie G. Valiant, A bridging model for parallel computation Communications of the ACM. ,vol. 33, pp. 103- 111 ,(1990) , 10.1145/79173.79181
John R. Koza, David Andre, Parallel Genetic Programming on a Network of Transputers Stanford University. ,(1995)
D. E. Goldberg, Genetic Algorithms in Search Optimization, and MachineLearning. pp. 192- 208 ,(1989)
David E. Goldberg, Genetic algorithms in search, optimization and machine learning Reading: Addison-Wesley. ,(1989)