Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/hal-00640805
Contributor : Imen Chakroun <>
Submitted on : Monday, November 14, 2011 - 12:05:07 PM
Last modification on : Thursday, April 4, 2019 - 10:18:06 AM
Document(s) archivé(s) le : Wednesday, February 15, 2012 - 2:22:38 AM

File

CP94.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00640805, version 1

Citation

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⟩

Share

Metrics

Record views

518

Files downloads

569