.png){kind=icon}
.png){kind=icon}
Return
Solving knapsack problems on GPU
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2011.03.014.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A parallel implementation via CUDA of the dynamic programming method for the knapsack problem on NVIDIA GPU is presented. A GTX 260 card with 192 cores (1.4 GHz) is used for computational tests and processing times obtained with the parallel code are compared to the sequential one on a CPU with an Intel Xeon 3.0 GHz. The results show a speedup factor of 26 for large size problems. Furthermore, in order to limit the communication between the CPU and the CPU, a compression technique is presented which decreases significantly the memory occupancy. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Combinatorial optimization problems
Dense dynamic programming
Parallel computing
GPU computing
CUDA
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W