A scalable cellular implementation of parallel genetic programming

被引:47
作者
Folino, G [1 ]
Pizzuti, C [1 ]
Spezzano, G [1 ]
机构
[1] Univ Calabria, ICAR, CNR, DEIS, I-87036 Arcavacata Di Rende, CE, Italy
关键词
cellular genetic programming model; genetic programming (GP); load balance; parallel processing; scalability;
D O I
10.1109/TEVC.2002.806168
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:37 / 53
页数:17
相关论文
共 41 条
[1]  
ANDRE D, 1997, INFORM SCI J
[2]  
[Anonymous], 1995, Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering
[3]  
[Anonymous], 1991, PRACTICE AUTONOMOUS, DOI DOI 10.1.1.49.212
[4]  
Cantu-Paz E., 2000, GENETIC ALGORITHMS E, V1
[5]  
CANTUPAZ E, 1999, 95007 U ILL URB CHAM
[6]   Parallel genetic simulated annealing: A massively parallel SIMD algorithm [J].
Chen, H ;
Flann, NS ;
Watson, DW .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1998, 9 (02) :126-136
[7]  
Dracopoulos D. C., 1996, Applied Parallel Computing. Industrial Computation and Optimization. Third International Workshop, PARA '96 Proceedings, P216
[8]  
DRACOPOULOS DC, 1996, P 1 ANN C GEN PROGR, P125
[9]  
Fernández F, 2001, LECT NOTES COMPUT SC, V2038, P51
[10]  
Fernández F, 2000, LECT NOTES COMPUT SC, V1908, P322