MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Speeding up genetic programming: A parallel BSP implementation (1996) [10 citations — 0 self]

Download:
Download as a PDF | Download as a PS
by Simon Kent, Dimitris C. Dracopoulos
Stanford University
http://http1.brunel.ac.uk:8080/~cspgssk/documents/gp96/gp96.ps.gz
Add To MetaCart

Abstract:

A parallel implementation of Genetic Programming is described, using the Bulk Synchronous Parallel Programming (BSP) model, as implemented by the Oxford BSP library. It is shown that considerable speedup of the GP execution can be achieved. As the complexity and the size of the problem increases, the actual speedup can be improved (assuming a constant number of processors), since the communication overhead is small compared with the parallel GP parts. The ease of use of BSP and the speedup achieved with the corresponding parallel implementation, suggests that GP researchers should consider BSP parallel implementations when dealing with time consuming problems. 1

Citations

1782 Genetic Programming: On the Programming of Computers by Means of Natural Selection Cambridge – Koza - 1992
970 A bridging model for parallel computation – Valiant - 1997
104 Serial and parallel genetic algorithms as function optimizers – Gordon, Whitely - 1993
49 A summary of research on parallel genetic algorithms – CantĂș-Paz - 1995
40 Parallel Genetic Programming on a Network of Transputers – Koza, Andre - 1995
11 The Oxford BSP Library Users' Guide – Miller, Reed - 1994
1 Using genetic programming techniques in problem solving. Final Year BSc Project – Kent - 1995