论文信息 - DSMR: a shared and distributed memory algorithm for single-source shortest path problem

DSMR: a shared and distributed memory algorithm for single-source shortest path problem

The Single-Source Shortest Path (SSSP) problem is to find the shortest paths from a source vertex to all other vertices in a graph. In this paper, we introduce the Dijkstra Strip-Mined Relaxation (DSMR) algorithm, an efficient parallel SSSP algorithm for shared and distributed memory systems. Our results show that, DSMR is faster than parallel Δ-Stepping by a factor of up-to 1.66.

[1] Fabio Checconi,et al. Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems , 2014, 2014 IEEE 28th International Parallel and Distributed Processing Symposium.

[2] Keshav Pingali,et al. Elixir: a system for synthesizing concurrent graph programs , 2012, OOPSLA '12.

[3] Christos Faloutsos,et al. R-MAT: A Recursive Model for Graph Mining , 2004, SDM.

[4] Andrew V. Goldberg,et al. Implementation Challenge for Shortest Paths , 2008, Encyclopedia of Algorithms.

[5] Ulrich Meyer,et al. [Delta]-stepping: a parallelizable shortest path algorithm , 2003, J. Algorithms.

[6] Jure Leskovec,et al. Defining and evaluating network communities based on ground-truth , 2012, Knowledge and Information Systems.

[7] Gergely Palla,et al. Fundamental statistical features and self-similar properties of tagged networks , 2008, 0812.4236.

[8] Albert,et al. Emergence of scaling in random networks , 1999, Science.