3607

Accelerating Particle Swarm Algorithm with GPGPU

M. Cadenas-Montes, M.A. Vega-Rodriguez, J.J. Rodriguez-Vazquez, A. Gomez-Iglesias
Dept. Fundamental Reseach, CIEMAT, Madrid, Spain
19th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), 2011

@conference{cardenas2011accelerating,

   title={Accelerating Particle Swarm Algorithm with GPGPU},

   author={Cardenas-Montes, M. and Vega-Rodriguez, M.A. and Rodriguez-Vazquez, J.J. and Gomez-Iglesias, A.},

   booktitle={Parallel, Distributed and Network-Based Processing (PDP), 2011 19th Euromicro International Conference on},

   pages={560–564},

   issn={1066-6192},

   organization={IEEE}

}

Source Source   

611

views

This paper focuses on solving large size optimization problems using GPGPU. Evolutionary Algorithms for solving these optimization problems suffer from the curse of dimensionality, which implies that their performance deteriorates as quickly as the dimensionality of the search space increases. This difficulty makes very challenging the performance studies for very high dimensional problems. Furthermore, these studies deal with a limited time-budget. The availability of low cost powerful parallel graphics cards has stimulated the implementation of diverse algorithms on Graphics Processing Units (GPU). In this paper, the design of a GPGPU-based Parallel Particle Swarm Algorithm, to tackle this type of problem maintaining a limited execution time budget, is described. This implementation profits of an efficient mapping of the data elements (swarm of very high dimensional particles) to the parallel processing elements of the GPU. In this problem, the fitness evaluation is the most CPU-costly routine, and therefore the main candidate to be implemented on GPU. As main conclusion, the speed-up curve versus the increase in dimensionality is shown. This curve indicates an asymptotic limit stemmed from the data-parallel mapping.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: