Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Parallel genetic algorithms on distributed-memory architectures
NATUG-6 Proceedings of the sixth conference of the North American Transputer Users Group on Transputer research and applications 6
Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
Advances in genetic programming
Advances in genetic programming
Advances in genetic programming: volume 2
Advances in genetic programming: volume 2
Advances in genetic programming
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Distributed genetic algorithms for function optimization
Distributed genetic algorithms for function optimization
Proceedings of the 1st annual conference on Genetic and evolutionary computation
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
A survey and taxonomy of performance improvement of canonical genetic programming
Knowledge and Information Systems
Parallel linear genetic programming
EuroGP'11 Proceedings of the 14th European conference on Genetic programming
Accelerated parallel genetic programming tree evaluation with OpenCL
Journal of Parallel and Distributed Computing
Hi-index | 0.07 |
This paper describes the successful parallel implementation of genetic programming on a network of processing nodes using the transputer architecture. With this approach, researchers of genetic algorithms and genetic programming can acquire computing power that is intermediate between the power of currently available workstations and that of supercomputers at intermediate cost. This approach is illustrated by a comparison of the computational effort required to solve a benchmark problem. Because of the decoupled character of genetic programming, our approach achieved a nearly linear speed up from parallelization. In addition, for the best choice of parameters tested, the use of subpopulations delivered a super-linear speed-up in terms of the ability of the algorithm to solve the problem. Several examples are also presented where the parallel genetic programming system evolved solutions that are competitive with human performance.