GPU Implementation of the Branch and Bound Method for Knapsack Problems

In this paper, we propose an efficient implementation of the branch and bound method for knapsack problems on a CPU-GPU system via CUDA. Branch and bound computations can be carried out either on the CPU or on a GPU according to the size of the branch and bound list. A better management of GPUs memo...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2012 26th IEEE International Parallel and Distributed Processing Symposium Workshops s. 1769 - 1777
Hlavní autori: Lalami, M. E., El-Baz, D.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.05.2012
Predmet:
branch and bound method
Central Processing Unit
combinatorial optimization
Computer architecture
CUDA
GPU computing
Graphics processing unit
hybrid computing
Instruction sets
Kernel
knapsack problems
Optimization
Upper bound
ISBN:1467309745, 9781467309745
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, we propose an efficient implementation of the branch and bound method for knapsack problems on a CPU-GPU system via CUDA. Branch and bound computations can be carried out either on the CPU or on a GPU according to the size of the branch and bound list. A better management of GPUs memories, less GPU-CPU communications and better synchronization between GPU threads are proposed in this new implementation in order to increase efficiency. Indeed, a series of computational results is displayed and analyzed showing a substantial speedup on a Tesla C2050 GPU.
ISBN:1467309745
9781467309745
DOI:10.1109/IPDPSW.2012.219