TY - CHAP
T1 - Parallel evolutionary algorithms on consumer-level graphics processing unit
AU - Wong, Tien-Tsin
AU - Wong, Man Leung
PY - 2006
Y1 - 2006
N2 - In this research, we have implemented a parallel EP on consumer-level graphics processing units and proposed indirect indexing and many optimization skills to achieve maximal efficiency. The parallel EP is a hybrid of masterslave and fine-grained models. Competition and selection are performed by CPU (i.e. the master) while fitness evaluation, mutation, and reproduction are performed by GPU which is essentially a massively parallel machine with shared memory. Unlike other fine-grained parallel computers such as Maspar, GPU allows processors to communicate with, not only nearby processors, but also any other processors. Hence more flexible fine-grained EAs can be implemented on GPU. We have done experiments to compare our parallel EP on GPU and an ordinary EP on CPU. It is found that the speed-up factor of our parallel EP ranges from 1.25 to 5.02, when the population size is large enough. Moreover, there is a sub-linear relation between the population size and the execution time. Thus, our parallel EP will be very useful for solving difficult problems that require huge population sizes. For future work, we plan to implement a parallel genetic algorithm on GPU and compare it with the approach reported in this paper.
AB - In this research, we have implemented a parallel EP on consumer-level graphics processing units and proposed indirect indexing and many optimization skills to achieve maximal efficiency. The parallel EP is a hybrid of masterslave and fine-grained models. Competition and selection are performed by CPU (i.e. the master) while fitness evaluation, mutation, and reproduction are performed by GPU which is essentially a massively parallel machine with shared memory. Unlike other fine-grained parallel computers such as Maspar, GPU allows processors to communicate with, not only nearby processors, but also any other processors. Hence more flexible fine-grained EAs can be implemented on GPU. We have done experiments to compare our parallel EP on GPU and an ordinary EP on CPU. It is found that the speed-up factor of our parallel EP ranges from 1.25 to 5.02, when the population size is large enough. Moreover, there is a sub-linear relation between the population size and the execution time. Thus, our parallel EP will be very useful for solving difficult problems that require huge population sizes. For future work, we plan to implement a parallel genetic algorithm on GPU and compare it with the approach reported in this paper.
UR - https://www.scopus.com/pages/publications/33748914163
U2 - 10.1007/3-540-32839-4_7
DO - 10.1007/3-540-32839-4_7
M3 - Chapter (Book)
AN - SCOPUS:33748914163
SN - 3540328378
SN - 9783540328377
T3 - Studies in Computational Intelligence
SP - 133
EP - 155
BT - Parallel Evolutionary Computations
A2 - Nedjah, Nadia
A2 - Alba, Enrique
A2 - Mourelle, Macedo
PB - Springer
ER -