Solving knapsack problems on GPU - Archive ouverte HAL Access content directly
Journal Articles Computers and Operations Research Year : 2012

Solving knapsack problems on GPU

(1) , (1) , (1)
1

Abstract

In this article, we propose a parallel implementation of the dynamic programming method for the knapsack problem on NVIDIA GPU. A GTX 260 (192 cores, 1.4GHz) was 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 up to 26 and permit one to solve large size problems within a reasonable processing time. Furthermore, in order to limit the communication between the CPU and the GPU, a compression technique is presented which decreases significantly the memory occupancy.
Fichier principal
Vignette du fichier
ArticleCuda.pdf (120.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01152223 , version 1 (15-05-2015)

Identifiers

Cite

Vincent Boyer, Didier El Baz, Moussa Elkihel. Solving knapsack problems on GPU. Computers and Operations Research, 2012, 39 (1), pp.42-47. ⟨10.1016/j.cor.2011.03.014⟩. ⟨hal-01152223⟩
307 View
2032 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More