Abstract
Optimization can be defined as the act of getting the best result under given circumstances. Evolutionary algorithms are widely used for solving optimization problems. One of these evolutionary algorithms is Particle Swarm Optimization (PSO). Different kinds of PSO such as Adaptive Particle Swarm Optimization (APSO), have been presented to improve the original PSO and eliminate its disadvantages. Although APSO can overcome the problem of premature convergence and accelerate the convergence speed at the same time, it is computationally intensive because of its nested loops. The goal of this paper is high performance implementation of APSO algorithm based on GPU. In order to analyze this algorithm and evaluate its computational time, we have implemented APSO on both CPU and GPU. Different parallelisms such as loop-level parallelism have been exploited and we have achieved significant speedup up to 152x compared to CPU based implementation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.