Abstract:
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...Show MoreMetadata
Abstract:
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.
Published in: 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum
Date of Conference: 21-25 May 2012
Date Added to IEEE Xplore: 20 August 2012
Print ISBN:978-1-4673-0974-5