A GPU Parallel Particle Swarm Optimization Method Based on Adaptive Warps
A particle swarm optimization and thread warp technology, applied in concurrent instruction execution, machine execution device, program control design, etc., can solve problems such as enlargement, and achieve the effect of reducing power consumption, saving hardware costs, and shortening the time to solve problems
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0047] Such as figure 1 As shown, it is a kind of GPU parallel particle swarm optimization method based on adaptive warp of the present embodiment, comprising the following steps:
[0048] Step 1: Initialize the problem function parameters and initialize the particle swarm parameters;
[0049] Step 2: Define three CUDA kernel functions, which are used to calculate the velocity and position of the particle in parallel, the fitness value of the particle, the best fitness value found by the next generation particle itself and its corresponding solution, and the entire particle swarm up to now The best fitness value found so far and its corresponding solution;
[0050] Step 3: Calculate and initialize the BlockNum and GridNum of each kernel function according to the adaptive warp algorithm;
[0051] Step 4: Call the kernel function to iteratively update the velocity and position of the particle swarm in parallel, and find the current best fitness value and its corresp...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


