Reducing thread divergence in a GPU-accelerated branch-and-bound algorithm
|In this paper, we address the design and implementation of GPU-accelerated Branch-and-Bound algorithms (B&B) for solving Flow-shop scheduling optimization problems (FSP). Such applications are CPU-time consuming and highly irregular. On the other hand, GPUs are massively multi-threaded accelerators using the SIMD model at execution. A major issue which raises when executing on GPU a B&B applied to FSP is thread or branch divergence. Such divergence is caused by the lower bound function of FSP which contains many irregular loops and conditional instructions. Our challenge is therefore to revisit the design and implementation of B&B applied to FSP dealing with thread divergence. Extensive experiments of the proposed approach have been carried out on well-known FSP benchmarks using an Nvidia Tesla C2050 GPU card. Compared to a CPU-based execution, accelerations up to ×77.46 are achieved for large problem instances.
|Concurrency and Computation: Practice and Experience
|Concurrency and Computation: Practice and Experience;25(8)
|Calcul Pervasif et Mobile
|GPU computing; Branch-and-bound algorithms; Data parallelism; Thread divergence.
|Reducing thread divergence in a GPU-accelerated branch-and-bound algorithm