arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.15217cs.DScs.DC
收藏

欧拉遇到GPU:有理论保证的实用图算法

Euler Meets GPU: Practical Graph Algorithms with Theoretical Guarantees

Adam Polak, Adrian Siwiec, Michał Stobierski

摘要:

欧拉巡回技术是设计并行图算法的经典工具,最初是为PRAM模型提出的。我们问它是否可以适应在GPU上高效运行。我们专注于两个既定的应用程序的技术:(1)的问题,寻找最低共同祖先(LCA)的节点对树,(2)的问题,在无向图中找到桥梁。在我们的实验中,我们比较理论上最优的算法,使用欧拉巡回技术对简单的appropriistics应该执行特别好的典型实例。我们表明,欧拉巡回赛为基础的算法不仅履行其理论承诺,并在硬的情况下优于实际算法,但也表现出与他们在简单的情况下。

英文摘要:

The Euler tour technique is a classical tool for designing parallel graph algorithms, originally proposed for the PRAM model. We ask whether it can be adapted to run efficiently on GPU. We focus on two established applications of the technique: (1) the problem of finding lowest common ancestors (LCA) of pairs of nodes in trees, and (2) the problem of finding bridges in undirected graphs. In our experiments, we compare theoretically optimal algorithms using the Euler tour technique against simpler heuristics supposed to perform particularly well on typical instances. We show that the Euler tour-based algorithms not only fulfill their theoretical promises and outperform practical heuristics on hard instances, but also perform on par with them on easy instances.

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

↑