Skipper: 一次边遍历的最大匹配
Skipper: Maximal Matching with a Single Pass over Edges
AI总结:
Skipper通过一次边遍历实现高效最大匹配,无需剪枝和额外内存,显著提升大规模图处理效率。
摘要:
最大匹配(MM)是一个基础的图问题,具有广泛的应用。尽管最先进的并行MM算法总的工作量与边数成线性关系,但它们需要随机化、迭代图处理以及每次迭代后都需要图剪枝。这些开销会增加执行时间并要求额外的内存,从而降低其在大规模图中的适用性。在本文中,我们介绍了Skipper,一种异步的最大匹配算法,它通过并行预留策略即时解决冲突,将预留和提交步骤合并为一个步骤。Skipper处理每条边仅一次,明确确定该边是否被选为匹配边。Skipper不需要图剪枝,并且最小化内存空间的使用,仅需要每个顶点一个字节的内存空间。此外,Skipper在异步并行随机访问机(APRAM)模型中运行,放松了线程之间的同步,从而促进更好的并行化收益。我们的评估是在具有多达224十亿条边的真实世界和合成图上进行的,结果显示Skipper实现了4.9-15.6倍的速度提升,几何平均为8.0倍。
英文摘要:
Maximal Matching (MM) is a fundamental graph problem with diverse applications. While state-of-the-art parallel MM algorithms have a total expected work linear in number of edges, they require randomization, iterative graph processing, and graph pruning after each iteration. These overheads increase execution time and demand additional memory, reducing applicability to large-scale graphs. In this paper, we introduce Skipper, an asynchronous Maximal Matching algorithm that resolves conflicts instantaneously using a parallel reservation strategy, which merges both reservation and committing steps into a single step. Skipper processes each edge only once, definitively determining whether the edge is selected as a match. Skipper does not require graph pruning and minimizes memory space utilization, requiring only a single byte of memory space per vertex. Furthermore, Skipper operates in the asynchronous parallel random access machine (APRAM) model, relaxing synchronization between threads, and facilitating better parallelization gains. Our evaluation, conducted on real-world and synthetic graphs with up to 224 billion edges, shows that Skipper achieves a speedup of 4.9--15.6 times, with a geometric mean of 8.0 times.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。