Portable <scp>PGAS</scp> ‐Based <scp>GPU</scp> ‐Accelerated Branch‐And‐Bound Algorithms at Scale

ABSTRACT The Branch‐and‐Bound (B&amp;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&amp;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&amp;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, whereas 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 1024 GPUs.