Parallel co-processor for PSO Online publication date: Sat, 21-Mar-2015
by Rogério De Moraes Calazan; Nadia Nedjah; Luiza De Macedo Mourelle
International Journal of High Performance Systems Architecture (IJHPSA), Vol. 3, No. 4, 2011
Abstract: The particle swarm optimisation or PSO is a heuristic based on a population of individuals, in which the candidates for a solution of the problem at hand evolve through a simulation process of a social adaptation simplified model. Combining robustness, efficiency and simplicity, PSO has gained great popularity as many successful applications are reported. The algorithm has proven to have several advantages over other algorithms that are based on swarm intelligence principles. The use of PSO for solving problems that involve computationally demanding functions often results in low performance. In order to accelerate the process, one can proceed with the parallelisation of the algorithm and/or mapping it directly onto hardware. This paper presents a novel massively parallel co-processor for PSO implemented in reconfigurable hardware. The implementation results show that the proposed architecture is very promising as it achieved superior performance in terms of execution time when compared to the direct software execution of the algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Systems Architecture (IJHPSA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook