Parallel evolutionary algorithms on consumer-level graphics processing unit
Parallel Evolutionary Computations
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.
Copyright © Springer-Verlag Berlin Heidelberg 2006
Access to external full text or publisher's version may require subscription.
ISBN of the source publication: 9783540328377
Wong, T.-T., & Wong, M. L. (2006). Parallel evolutionary algorithms on consumer-level graphics processing unit. In N. Nedjah, E. Alba & L. de Macedo Mourelle (Eds.), Parallel evolutionary computations (pp.133-155). doi: 10.1007/3-540-32839-4_7