Reducing Thread Divergence in GPU-based B&B Applied to the Flow-shop problem - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Reducing Thread Divergence in GPU-based B&B Applied to the Flow-shop problem

Abstract

In this paper,we propose a pioneering work on designing and programming B&B algorithms on GPU. To the best of our knowledge, no contribution has been proposed to raise such challenge. We focus on the parallel evaluation of the bounds for the Flow-shop scheduling problem. To deal with thread divergence caused by the bounding operation, we investigate two software based approaches called thread data reordering and branch refactoring. Experiments reported that parallel evaluation of bounds speeds up execution up to 54.5 times compared to a CPU version.
Fichier principal
Vignette du fichier
CP94.pdf (105.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00640805 , version 1 (14-11-2011)

Identifiers

  • HAL Id : hal-00640805 , version 1

Cite

Imen Chakroun, Ahcène Bendjoudi, Nouredine Melab. Reducing Thread Divergence in GPU-based B&B Applied to the Flow-shop problem. 9th INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING AND APPLIED MATHEMATICS (PPAM 2011), Sep 2011, Torun, Poland. ⟨hal-00640805⟩
243 View
312 Download

Share

Gmail Facebook Twitter LinkedIn More