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

用Apache Spark解决大型图中的所有对最短路问题

Solving All-Pairs Shortest-Paths Problem in Large Graphs Using Apache Spark

Frank Schoeneman, Jaroslaw Zola

摘要:

计算所有对最短路径(APSP)的算法是许多实际应用的关键基础。标准的顺序算法,如Floor-Warshall和Johnson,很快就变得不可行的大型输入图,需要并行的方法。在这项工作中,我们使用Apache Spark对分布式内存集群上的并行APSP性能进行了详细分析。Spark模型允许可移植且易于部署的分布式实现,因此从最终用户的角度来看是有吸引力的。我们为大型无向加权图提出了四种不同的APSP实现,它们在复杂性和对纯Spark API之外的技术的依赖程度上有所不同。我们证明了Spark能够在1024核集群上处理超过200,000个顶点的APSP问题,并且可以与基于幼稚MPI的解决方案竞争。然而,我们的最佳性能求解器需要辅助共享持久存储,并且比优化的基于MPI的求解器慢两倍以上。

英文摘要:

Algorithms for computing All-Pairs Shortest-Paths (APSP) are critical building blocks underlying many practical applications. The standard sequential algorithms, such as Floyd-Warshall and Johnson, quickly become infeasible for large input graphs, necessitating parallel approaches. In this work, we provide detailed analysis of parallel APSP performance on distributed memory clusters with Apache Spark. The Spark model allows for a portable and easy to deploy distributed implementation, and hence is attractive from the end-user point of view. We propose four different APSP implementations for large undirected weighted graphs, which differ in complexity and degree of reliance on techniques outside of pure Spark API. We demonstrate that Spark is able to handle APSP problems with over 200,000 vertices on a 1024-core cluster, and can compete with a naive MPI-based solution. However, our best performing solver requires auxiliary shared persistent storage, and is over two times slower than optimized MPI-based solver.

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

↑