arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.01356cs.DS
收藏

可证明的快速且空间高效的并行双连通性

Provably Fast and Space-Efficient Parallel Biconnectivity

UC Riverside(加州大学河滨分校)

Xiaojun Dong, Letong Wang, Yan Gu, Yihan Sun

AI总结:

本文提出了一种高效且空间节省的并行双连通性算法FAST-BCC,实现了最优工作量和多项式对数跨度,且在多个实际图上均表现最佳。

摘要:

双连通性是最重要的图问题之一。经典的并行双连通性算法是Tarjan-Vishkin算法,该算法在具有n个顶点和m条边的图上具有最优的工作量(操作数)和多项式对数跨度(最长依赖操作)。然而,Tarjan-Vishkin算法在实践中并未被广泛使用。我们认为原因在于其空间效率低下(它生成一个具有O(m)条边的辅助图)。在实践中,现有的并行实现是基于广度优先搜索(BFS)。由于BFS的跨度与图的直径成正比,现有的并行BCC实现对大直径图表现不佳,甚至在许多实际图上可能比顺序算法更慢。我们提出了第一个并行双连通性算法(FAST-BCC),它具有最优的工作量、多项式对数跨度,并且是空间高效的。我们的算法首先基于输入图的任何生成树生成一个骨架图。然后我们使用骨架图的连通性信息来计算原始输入图的双连通性。我们的算法中的所有步骤都是高度并行的。我们仔细分析了我们算法的正确性,这非常非平凡。我们实现了FAST-BCC,并将其与现有实现进行了比较,包括GBBS、Slota和Madduri的算法,以及顺序的Hopcroft-Tarjan算法。我们在96核机器上对27个图进行了测试,包括社交、网络、道路、k-NN和合成图,这些图的大小和边分布差异显著。FAST-BCC在所有27个图上都是最快的。平均而言(几何均值),FAST-BCC比GBBS快5.1倍,比每个图上的最佳现有基线快3.1倍。

英文摘要:

Biconnectivity is one of the most fundamental graph problems. The canonical parallel biconnectivity algorithm is the Tarjan-Vishkin algorithm, which has $O(n+m)$ optimal work (number of operations) and polylogarithmic span (longest dependent operations) on a graph with $n$ vertices and $m$ edges. However, Tarjan-Vishkin is not widely used in practice. We believe the reason is the space-inefficiency (it generates an auxiliary graph with $O(m)$ edges). In practice, existing parallel implementations are based on breath-first search (BFS). Since BFS has span proportional to the diameter of the graph, existing parallel BCC implementations suffer from poor performance on large-diameter graphs and can be even slower than the sequential algorithm on many real-world graphs. We propose the first parallel biconnectivity algorithm (FAST-BCC) that has optimal work, polylogarithmic span, and is space-efficient. Our algorithm first generates a skeleton graph based on any spanning tree of the input graph. Then we use the connectivity information of the skeleton to compute the biconnectivity of the original input. All the steps in our algorithm are highly-parallel. We carefully analyze the correctness of our algorithm, which is highly non-trivial. We implemented FAST-BCC and compared it with existing implementations, including GBBS, Slota and Madduri's algorithm, and the sequential Hopcroft-Tarjan algorithm. We ran them on a 96-core machine on 27 graphs, including social, web, road, $k$-NN, and synthetic graphs, with significantly varying sizes and edge distributions. FAST-BCC is the fastest on all 27 graphs. On average (geometric means), FAST-BCC is 5.1$\times$ faster than GBBS, and 3.1$\times$ faster than the best existing baseline on each graph.

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

↑