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

共享存储器结构的并行增量步进算法

Parallel Delta-Stepping Algorithm for Shared Memory Architectures

M. Kranjčević, D. Palossi, S. Pintarelli

摘要:

我们提出了一个共享内存实现的并行算法,称为增量步进,解决单源最短路径问题的有向和无向图。为了减少同步成本,我们做了一些偏离的算法,并讨论了后果。我们研究的行为,我们的实现小世界和无标度图,以及图形所产生的游戏地图。我们收集多核CPU和英特尔至强融核的性能数据。当在顺序模式下运行时,我们的实现优于Boost Graph Library中的Dijkstra算法在小直径图上的实现。在CPU和协处理器上,我们实现了至少50%并行效率的整体性能。

英文摘要:

We present a shared memory implementation of a parallel algorithm, called delta-stepping, for solving the single source shortest path problem for directed and undirected graphs. In order to reduce synchronization costs we make some deviations from the algorithm and discuss the consequences. We study the behaviour of our implementation on small-world and scale-free graphs, and graphs arising from game maps. We collect performance data on multi-core CPUs and Intel Xeon Phi. When run in sequential mode, our implementation outperforms the implementation of Dijkstra's algorithm from Boost Graph Library on graphs with a small diameter. Both on the CPU and the co-processor we achieve an overall performance of at least 50% parallel efficiency.

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

↑