Coarse grain parallelization of evolutionary algorithms on GPGPU cards with EASEA

67Citations
Citations of this article
56Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a straightforward implementation of a standard evolutionary algorithm that evaluates its population in parallel on a GPGPU card. Tests done on a benchmark and a real world problem using an old NVidia 8800GTX card and a newer but not top of the range GTX260 card show a roughly 30x (resp. 100x) speedup for the whole algorithm compared to the same algorithm running on a standard 3.6GHz PC. Knowing that much faster hardware is already available, this opens new horizons to evolutionary computation, as search spaces can now be explored 2 or 3 orders of magnitude faster, depending on the number of used GPGPU cards. Since these cards remains very difficult to program, the knowhow has been integrated into the old EASEA language, that can now output code for GPGPU (-cuda option). Copyright 2009 ACM.

Cite

CITATION STYLE

APA

Maitre, O., Baumes, L. A., Lachiche, N., Corma, A., & Collet, P. (2009). Coarse grain parallelization of evolutionary algorithms on GPGPU cards with EASEA. In Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009 (pp. 1403–1410). https://doi.org/10.1145/1569901.1570089

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free