An Efficient Fine-grained Parallel Genetic Algorithm Based on GPU-Accelerated
Dalian University of Technology, DaLian, 116024, China
Network and Parallel Computing Workshops, 2007. NPC Workshops. IFIP International Conference on In Network and Parallel Computing Workshops, 2007. NPC Workshops. IFIP International Conference on (2007), pp. 855-862
@conference{li2007efficient,
title={An efficient fine-grained parallel genetic algorithm based on gpu-accelerated},
author={Li, J.M. and Wang, X.J. and He, R.S. and Chi, Z.X.},
booktitle={Network and Parallel Computing Workshops, 2007. NPC Workshops. IFIP International Conference on},
pages={855–862},
year={2007},
organization={IEEE}
}
Fine-grained parallel genetic algorithm (FGPGA), though a popular and robust strategy for solving complicated optimization problems, is sometimes inconvenient to use as its population size is restricted by heavy data communication and the parallel computers are relatively difficult to use, manage, maintain and may not be accessible to most researchers. In this paper, we propose a FGPGA method based on GPU-acceleration, which maps parallel GA algorithm to texture-rendering on consumer-level graphics cards. The analytical results demonstrate that the proposed method increases the population size, speeds up its execution and provides ordinary users with a feasible FGPGA solution.
December 5, 2010 by hgpu
