An introduction to parallelism in combinatorial optimization
Parallel computers and computations
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
A parallel two-list algorithm for the knapsack problem
Parallel Computing
Journal of Parallel and Distributed Computing
Load Balancing in a Parallel Dynamic Programming Multi-Method Applied to the 0-1 Knapsack Problem
PDP '06 Proceedings of the 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing
A dynamic programming method with lists for the knapsack sharing problem
Computers and Industrial Engineering
Efficient Implementation of the Simplex Method on a CPU-GPU System
IPDPSW '11 Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum
Parallel design for error-resilient entropy coding algorithm on GPU
Journal of Parallel and Distributed Computing
A scalable GPU-based approach to accelerate the multiple-choice knapsack problem
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Proceedings of Programming Models and Applications on Multicores and Manycores
| Hi-index | 0.01 |
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.4GHz) 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.0GHz. The results show a speedup factor of 26 for large size problems. Furthermore, in order to limit the communication between the CPU and the GPU, a compression technique is presented which decreases significantly the memory occupancy.