HB&B@GRID: An heterogeneous grid-enabled Branch and Bound algorithm - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

HB&B@GRID: An heterogeneous grid-enabled Branch and Bound algorithm

(1) , (2)
1
2
Imen Chakroun
  • Function : Author

Abstract

In this paper, we propose an extended version of the hybrid multi-core and GPU-accelerated Branch-and-Bound (B&B) algorithm previously introduced for massively-parallel distributed and heterogeneous environments. The proposed algorithm consists in hierarchically combining two levels of parallelism by (1) dividing the B&B tree exploration among multiple distributed resources using the B&B@GRID approach, and (2) exploring in parallel each sub-tree using an heterogeneous meta-algorithm. Using this portable, heterogeneous and self-adaptive approach allows to achieve high performance.
Not file

Dates and versions

hal-01419078 , version 1 (18-12-2016)

Identifiers

Cite

Imen Chakroun, Nouredine Melab. HB&B@GRID: An heterogeneous grid-enabled Branch and Bound algorithm. 2016 International Conference on High Performance Computing & Simulation (HPCS), Jul 2016, Innsbruck, Austria. ⟨10.1109/HPCSim.2016.7568403⟩. ⟨hal-01419078⟩
90 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More