Article Dans Une Revue Concurrency and Computation: Practice and Experience Année : 2025

Portable PGAS-based GPU-accelerated Branch-and-Bound Algorithms at Scale

Résumé

The Branch-and-Bound (B&B) technique plays a key role in solving many combinatorial optimization problems, enabling efficient problem-solving and decision-making in a wide range of applications. It incrementally constructs a tree by building candidates to the solutions, and abandoning a candidate as soon as it determines that it cannot lead to an optimal solution. With modern problems growing increasingly large, accelerating B&B algorithms through parallelization has become a critical challenge for handling large solution spaces. At the same time, modern parallel computing systems themselves are becoming larger, more heterogeneous, and more diverse, requiring programming approaches capable of effectively exploiting such complexity. To address these challenges, this work presents a GPU-accelerated B&B algorithm based on the Partitioned Global Address Space (PGAS) programming model, implemented using the Chapel language. The PGAS-based design is motivated by the high-level abstraction provided by this programming model, which favors programmability, while vendor-neutral GPU features of the Chapel language favor GPU portability. The algorithm uses a pool-based approach for generality, and exploits a dynamic load balancing mechanism for performance scalability. Extensive experimentation on the N-Queens and permutation flowshop scheduling problems demonstrated both code performance and code portability of the proposed algorithm on several GPU architectures compared to optimized CUDA-based implementations. Moreover, the strong scaling efficiency of the proposed algorithm is investigated on a TOP500 pre-exascale supercomputer up to 1,024 GPUs.

Fichier principal
Vignette du fichier
Concurrency and Computation - 2025 - Helbecque - Portable PGAS‐Based GPU‐Accelerated Branch‐And‐Bound Algorithms at Scale.pdf (3.9 Mo) Télécharger le fichier
Origine Publication financée par une institution
Licence

Dates et versions

hal-05267434 , version 1 (13-10-2025)

Licence

Identifiants

Citer

Guillaume Helbecque, Ezhilmathi Krishnasamy, Tiago Carneiro, Nouredine Melab, Pascal Bouvry. Portable PGAS-based GPU-accelerated Branch-and-Bound Algorithms at Scale. Concurrency and Computation: Practice and Experience, 2025, 37 (25-26), pp.e70321. ⟨10.1002/cpe.70321⟩. ⟨hal-05267434⟩
208 Consultations
146 Téléchargements

Altmetric

Partager

  • More