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

修剪地标标签满足顶点中心计算:一个令人惊讶的幸福婚姻!

Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage!

Ruoming Jin, Zhen Peng, Wendell Wu, Feodor Dragan, Gagan Agrawal, Bin Ren

摘要:

在本文中,我们研究如何修剪地标标记(PPL)算法可以并行化的可扩展的方式,产生相同的结果作为顺序算法。更具体地说,我们并行化使用顶点为中心的(VC)计算模型上的现代SIMD供电的多核架构。我们设计了一种新的VC-PLL算法,解决了PLL算法固有的顺序依赖性和顶点中心(VC)计算模型之间的明显不匹配。此外,我们引入了一种新的VC计算的批处理执行模型和BVC-PLL算法,以减少在VC-PLL的计算效率低下。令人惊讶的是,理论分析表明,在合理的假设下,BVC-PLL具有较低的计算和存储器访问成本比PLL,并表明它可以运行速度比PLL作为一个顺序算法。我们还演示了如何BVC-PLL算法可以扩展到处理有向图和加权图,以及它如何利用现代并行计算架构上的层次并行性。在真实图形上的大量实验不仅表明顺序BVC-PLL的运行速度比原始PLL快两倍以上,而且还证明了其并行效率和可扩展性。

英文摘要:

In this paper, we study how the Pruned Landmark Labeling (PPL) algorithm can be parallelized in a scalable fashion, producing the same results as the sequential algorithm. More specifically, we parallelize using a Vertex-Centric (VC) computational model on a modern SIMD powered multicore architecture. We design a new VC-PLL algorithm that resolves the apparent mismatch between the inherent sequential dependence of the PLL algorithm and the Vertex- Centric (VC) computing model. Furthermore, we introduce a novel batch execution model for VC computation and the BVC-PLL algorithm to reduce the computational inefficiency in VC-PLL. Quite surprisingly, the theoretical analysis reveals that under a reasonable assumption, BVC-PLL has lower computational and memory access costs than PLL and indicates it may run faster than PLL as a sequential algorithm. We also demonstrate how BVC-PLL algorithm can be extended to handle directed graphs and weighted graphs and how it can utilize the hierarchical parallelism on a modern parallel computing architecture. Extensive experiments on real-world graphs not only show the sequential BVC-PLL can run more than two times faster than the original PLL, but also demonstrates its parallel efficiency and scalability.

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

↑