Exact combinatorial search is essential to a wide range of important applications, and there are many large problems that need to be solved quickly. Searches are extremely challenging to parallelise due to a combination of factors, e.g. searches are non-deterministic, dynamic pruning changes the workload, and search tasks have very different runtimes. YewPar is a C++/HPX framework that generalises parallel search by providing a range of sophisticated search skeletons.This paper demonstrates generic high performance combinatorial search, i.e. that a variety of exact combinatorial searches can be easily parallelised for HPC using YewPar. We present a new mechanism for profiling key aspects of YewPar parallel combinatorial search, and demonstrate its value. We exhibit, for the first time, generic exact combinatorial searches at HPC scale. We baseline YewPar against state-of-the-art sequential C++ and C++/OpenMP implementations. We demonstrate that deploying YewPar on an HPC system can dramatically reduce the runtime of large problems, e.g. from days to just 100s. The maximum relative speedups we achieve for an enumeration search are near-linear up to 195(6825) compute-nodes(workers), super-linear for an optimisation search on up to 128(4480) (pruning reduces the workload), and sub-linear for decision searches on up to 64(2240) compute-nodes(workers).

精确组合搜索对于范围广泛的重要应用至关重要，并且有许多需要快速解决的大问题。由于多种因素的组合，搜索很难并行化，例如搜索是不确定的，动态修剪会改变工作负载，搜索任务具有非常不同的运行时间。YewPar 是一个 C++/HPX 框架，它通过提供一系列复杂的搜索骨架来概括并行搜索。本文演示了通用的高性能组合搜索，即可以使用 YewPar 为 HPC 轻松并行化各种精确组合搜索。我们提出了一种新机制来分析 YewPar 并行组合搜索的关键方面，并展示了它的价值。我们首次展示了 HPC 规模的通用精确组合搜索。我们将 YewPar 与最先进的顺序 C++ 和 C++/OpenMP 实现作为基线。我们证明在 HPC 系统上部署 YewPar 可以显着减少大型问题的运行时间，例如从几天减少到仅 100 秒。我们为枚举搜索实现的最大相对加速在 195(6825) 个计算节点（工作者）上接近线性，在高达 128(4480) 个计算节点（工作节点）上的优化搜索是超线性的（修剪减少了工作量），