Abstract
Particle Swarm Optimization (PSO) is heuristics-based method, in which the solution candidates of a problem go through a process that simulates a simplified model of social adaptation. In this paper, we propose three alternative algorithms to massively parallelize the PSO algorithm and implement them using a GPGPU-based architecture. We aim at improving the performance of computationally demanding optimizations of many-dimensional problems. The first algorithm parallelizes the particle’s work. The second algorithm subdivides the search space into a grid of smaller domains and distributes the particles among them. The optimization subprocesses are performed in parallel. The third algorithm focuses on the work done with respect to each of the problem dimensions and does it in parallel. Note that in the second and third algorithms, all particles act in parallel too. We analyze and compare the speedups achieved by the GPU-based implementations of the proposed algorithms, showing the highlights and limitations imposed.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: Proc. of IEEE International Conference on Neural Network, Australia, pp. 1942–1948. IEEE Press (1995)
Engelbrecht, A.P.: Fundamentals of Computational Swarm Intelligence. John Wiley & Sons Ltd., New Jersey (2005)
Nedjah, N., Coelho, L.S., Mourelle, L.M.: Multi-Objective Swarm Intelligent Systems − Theory & Experiences. Springer, Berlin (2010)
Calazan, R.M., Nedjah, N., Mourelle, L.M.: Parallel co-processor for PSO. Int. J. High Performance Systems Architecture 3(4), 233–240 (2011)
Calazan, R.M., Nedjah, N., Mourelle, L.M.: A Massively Parallel Reconfigurable Co-processor for Computationally Demanding Particle Swarm Optimization. In: 3rd International Symposium of IEEE Circuits and Systems in Latin America, LASCAS 2012. IEEE Computer Press, Los Alamitos (2012)
Calazan, R.M., Nedjah, N., de Macedo Mourelle, L.: Swarm Grid: A Proposal for High Performance of Parallel Particle Swarm Optimization Using GPGPU. In: Murgante, B., Gervasi, O., Misra, S., Nedjah, N., Rocha, A.M.A.C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2012, Part I. LNCS, vol. 7333, pp. 148–160. Springer, Heidelberg (2012)
NVIDIA: NVIDIA CUDA C Programming Guide, Version 4.0 NVIDA Corporation (2011)
Kirk, D.B., Hwu, W.-M.W.: Programming Massively Parallel Processors. Morgan Kaufmann, San Francisco (2010)
Veronese, L., Krohling, R.A.: Swarm’s flight: accelerating the particles using C-CUDA. In: 11th IEEE Congress on Evolutionary Computation, pp. 3264–3270. IEEE Press, Trondheim (2009)
Zhou, Y., Tan, Y.: GPU-based parallel particle swarm optimization. In: 11th IEEE Congress on Evolutionary Computation (CEC 2009), pp. 1493–1500. IEEE Press, Trondheim (2009)
Cádenas-Montes, M., Vega-Rodríguez, M.A., Rodríguez-Vázquez, J.J., Gómez-Iglesias, A.: Accelerating Particle Swarm Algorithm with GPGPU. In: 19th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), pp. 560–564. IEEE Press, Cyprus (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Calazan, R.M., Nedjah, N., de Macedo Mourelle, L. (2013). Three Alternatives for Parallel GPU-Based Implementations of High Performance Particle Swarm Optimization. In: Rojas, I., Joya, G., Gabestany, J. (eds) Advances in Computational Intelligence. IWANN 2013. Lecture Notes in Computer Science, vol 7902. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38679-4_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-38679-4_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38678-7
Online ISBN: 978-3-642-38679-4
eBook Packages: Computer ScienceComputer Science (R0)