arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2305.09117cs.DC
收藏

一种用于分支算法大规模并行化的轻量级半集中式策略

A lightweight semi-centralized strategy for the massive parallelization of branching algorithms

Andres Pastrana-Cruz, Manuel Lafond

AI总结:

本文提出一种轻量级半集中式并行化策略,通过减少通信开销并保持全局任务优先级跟踪,实现了分支算法的大规模并行化,并在顶点覆盖问题上显著加速求解。

摘要:

许多NP难问题通过指数时间分支策略精确求解,无论是分支定界算法,还是固定参数算法中的有界搜索树。顺序算法能够处理的易处理实例数量通常较少,而大规模并行化已被证明能显著扩大可精确求解的实例空间。然而,以往的集中式方法需要过多的通信才能高效运行,而分散式方法虽然更高效,但难以跟踪探索的全局状态。在这项工作中,我们提出重新审视集中式范式,同时避免先前的瓶颈。在我们的策略中,中心节点承担轻量级职责,每次通信仅需几个比特,但仍能跟踪每个工作节点的进度。特别是,中心节点从不持有任何任务,但能够保证没有工作的进程总能获得全局优先级最高的任务。我们的策略已在名为GemPBA的通用C++库中实现,程序员只需更改几行代码,即可将顺序分支算法转换为并行版本。对顶点覆盖问题的实验案例研究表明,DIMACS挑战图中最难的一些实例,顺序求解需要数月,而我们的方法可在两小时内处理完成。

英文摘要:

Several NP-hard problems are solved exactly using exponential-time branching strategies, whether it be branch-and-bound algorithms, or bounded search trees in fixed-parameter algorithms. The number of tractable instances that can be handled by sequential algorithms is usually small, whereas massive parallelization has been shown to significantly increase the space of instances that can be solved exactly. However, previous centralized approaches require too much communication to be efficient, whereas decentralized approaches are more efficient but have difficulty keeping track of the global state of the exploration. In this work, we propose to revisit the centralized paradigm while avoiding previous bottlenecks. In our strategy, the center has lightweight responsibilities, requires only a few bits for every communication, but is still able to keep track of the progress of every worker. In particular, the center never holds any task but is able to guarantee that a process with no work always receives the highest priority task globally. Our strategy was implemented in a generic C++ library called GemPBA, which allows a programmer to convert a sequential branching algorithm into a parallel version by changing only a few lines of code. An experimental case study on the vertex cover problem demonstrates that some of the toughest instances from the DIMACS challenge graphs that would take months to solve sequentially can be handled within two hours with our approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑