Skip to Main content Skip to Navigation
Conference papers

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

Imen Chakroun 1 Nouredine Melab 2
2 DOLPHIN - Parallel Cooperative Multi-criteria Optimization
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
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.
Complete list of metadata
Contributor : Nouredine Melab Connect in order to contact the contributor
Submitted on : Sunday, December 18, 2016 - 3:39:42 PM
Last modification on : Thursday, January 20, 2022 - 4:16:28 PM




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⟩



Les métriques sont temporairement indisponibles