Abstract
A parallel implementation of Genetic Programming (GP) is described, using the Bulk Synchronous Parallel Programming (BSP) model, as implemented by the Oxford BSP library. Two approaches to the parallel implementation of GP are examined. The first is based on global parallelisation while the second implements the island model for evolutionary algorithms. It is shown that considerable speedup of the GP execution can be achieved and that the BSP model is very suitable for parallelisation of similar algorithms.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
