arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.03256cs.DCcs.PF
收藏

一种在动态图上更新PageRank的增量扩展方法

An Incrementally Expanding Approach for Updating PageRank on Dynamic Graphs

Subhajit Sahu

AI总结:

本研究提出Dynamic Frontier动态图PageRank更新方法,可低开销识别受边批量更新影响的顶点,在64核服务器上性能优于现有方法2.9-7.8倍,线程每翻倍性能平均提升1.8倍。

摘要:

PageRank是一种流行的中心性度量指标,它基于图的顶点邻居及其邻居得分来为顶点分配重要性。高效的动态图PageRank更新并行算法对各类应用至关重要,尤其是在数据集规模已达到相当大尺度的当下。本技术报告提出了我们的Dynamic Frontier(动态前沿)方法:在给定边删除和插入的批量更新时,该方法能以极低开销逐步识别出排名可能发生变化的受影响顶点。在配备64核AMD EPYC-7742处理器的服务器上,针对大小为10^-7 |E|到10^-3 |E|的均匀随机批量更新,我们的Dynamic Frontier PageRank性能分别优于静态PageRank、朴素动态PageRank和动态遍历PageRank 7.8倍、2.9倍和3.9倍。此外,我们的方法在线程数每翻倍时,性能平均提升1.8倍。

英文摘要:

PageRank is a popular centrality metric that assigns importance to the vertices of a graph based on its neighbors and their score. Efficient parallel algorithms for updating PageRank on dynamic graphs is crucial for various applications, especially as dataset sizes have reached substantial scales. This technical report presents our Dynamic Frontier approach. Given a batch update of edge deletion and insertions, it progressively identifies affected vertices that are likely to change their ranks with minimal overhead. On a server equipped with a 64-core AMD EPYC-7742 processor, our Dynamic Frontier PageRank outperforms Static, Naive-dynamic, and Dynamic Traversal PageRank by 7.8x, 2.9x, and 3.9x respectively - on uniformly random batch updates of size 10^-7 |E| to 10^-3 |E|. In addition, our approach improves performance at an average rate of 1.8x for every doubling of threads.

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

↑