.png){kind=icon}
.png){kind=icon}
Return
A parallel particle swarm optimization algorithm based on GPU/CUDA
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2023.110499.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Parallel computing is the main way to improve the computational efficiency of metaheuristic algorithms for solving high-dimensional, nonlinear optimization problems. Previous studies have typically only implemented local parallelism for the particle swarm optimization (PSO) algorithm. In this study, we proposed a new parallel particle swarm optimization algorithm (GPU-PSO) based on the Graphics Processing Units (GPU) and Compute Unified Device Architecture (CUDA), which uses a combination of coarse-grained parallelism and fine-grained parallelism to achieve global parallelism. In addition, we designed a data structure based on CUDA features and utilized a merged memory access mode to further improve data-parallel processing and data access efficiency. Experimental results show that the algorithm effectively reduces the solution time of PSO for solving high-dimensional, large-scale optimization problems. The speedup ratio increases with the dimensionality of the objective function, where the speedup ratio is up to 2000 times for the high-dimensional Ackley function. & COPY; 2023 Elsevier B.V. All rights reserved.
Keywords:
Particle swarm optimization algorithm
Parallel computing
CUDA
GPU
function optimization [3]
traveling salesman problem [4]
wire
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W