.png){kind=icon}
.png){kind=icon}
Return
A scalable cellular implementation of parallel genetic programming
.png){kind=icon}
OA
AI
DOI：10.1109/TEVC.2002.806168.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A new parallel implementation of genetic programming (GP) based on the cellular model is presented and compared with both canonical GP and the island model approach. The method adopts a load-balancing policy that avoids the unequal utilization of the processors. Experimental results on benchmark problems of different complexity show the superiority of the cellular approach with respect to the canonical sequential implementation and the island model. A theoretical performance analysis reveals the high scalability of the implementation realized and allows to predict the size of the population when the number of processors and their efficiency are fixed.
Keywords:
cellular genetic programming model
genetic programming (GP)
load balance
parallel processing
scalability
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W
Organization
No organization information available