Parallel evolutionary algorithms on graphics processing unit
Dept. of Computing & Decision Sci., Lingnan University, Tuen Mun, Hong Kong, China
Evolutionary Computation, 2005. The 2005 IEEE Congress on In Evolutionary Computation, 2005. The 2005 IEEE Congress on, Vol. 3 (2005), pp. 2286-2293 Vol. 3
@conference{wong2005parallel,
title={Parallel evolutionary algorithms on graphics processing unit},
author={Wong, M.L. and Wong, T.T. and Fok, K.L.},
booktitle={Evolutionary Computation, 2005. The 2005 IEEE Congress on},
volume={3},
pages={2286–2293},
isbn={0780393635},
year={2005},
organization={IEEE}
}
Evolutionary algorithms (EAs) are effective and robust methods for solving many practical problems such as feature selection, electrical circuit synthesis, and data mining. However, they may execute for a long time for some difficult problems, because several fitness evaluations must be performed. A promising approach to overcome this limitation is to parallelize these algorithms. In this paper, we propose to implement a parallel EA on consumer-level graphics cards. We perform experiments to compare our parallel EA with an ordinary EA and demonstrate that the former is much more effective than the latter. Since consumer-level graphics cards are available in ubiquitous personal computers and these computers are easy to use and manage, more people are able to use our parallel algorithm to solve their problems encountered in real-world applications.
January 5, 2011 by hgpu
