Reducing thread divergence in a GPU-accelerated branch-and-bound algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Concurrency and Computation: Practice and Experience Année : 2013

Reducing thread divergence in a GPU-accelerated branch-and-bound algorithm

Résumé

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 arises 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.
Fichier principal
Vignette du fichier
cpedoc.pdf (247.13 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00731859 , version 1 (13-09-2012)

Identifiants

Citer

Imen Chakroun, Mohand Mezmaz, Nouredine Melab, Ahcène Bendjoudi. Reducing thread divergence in a GPU-accelerated branch-and-bound algorithm. Concurrency and Computation: Practice and Experience, 2013, 25 (8), pp.1121-1136. ⟨10.1002/cpe.2931⟩. ⟨hal-00731859⟩
395 Consultations
6130 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More