Abstract
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.
- A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science'99.Google Scholar
- V. Chakaravarthy, F. Checconi, F. Petrini, and Y. Sabharwal. Scalable single source shortest path algorithms for massively parallel systems. In IPDPS'14. Google Scholar
Digital Library
- D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-mat: A recursive model for graph mining. In SDM'04.Google Scholar
- C. Demetrescu, A. V. Goldberg, and D. S. Johnson. Implementation challenge for shortest paths. In Encyclopedia of Algorithms'08.Google Scholar
- Galois System. http://iss.ices.utexas.edu/?p=projects/galois.Google Scholar
- U. Meyer and P. Sanders. Delta-stepping: A parallelizable shortest path algorithm. J. Algorithms'03. Google Scholar
Digital Library
- G. Palla, I. J. Farkas, P. Pollner, I. Dernyi, and T. Vicsek. Fundamental statistical features and self-similar properties of tagged networks. New Journal of Physics.Google Scholar
- D. Prountzos, R. Manevich, and K. Pingali. Elixir: A system for synthesizing concurrent graph programs. OOPSLA '12. Google Scholar
Digital Library
- J. Yang and J. Leskovec. Defining and evaluating network communities based on ground-truth. In MDS '12. Google Scholar
Digital Library
Recommendations
DSMR: a shared and distributed memory algorithm for single-source shortest path problem
PPoPP '16: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel ProgrammingThe 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 ...
DSMR: A Parallel Algorithm for Single-Source Shortest Path Problem
ICS '16: Proceedings of the 2016 International Conference on SupercomputingThe Single Source Shortest Path (SSSP) problem consists in finding the shortest paths from a vertex (the source vertex) to all other vertices in a graph. SSSP has numerous applications. For some algorithms and applications, it is useful to solve the ...
A label-setting algorithm for finding a quickest path
The quickest path problem is to find a path to send a given amount of data from the source to the destination with minimum transmission time. To find the quickest path, existing algorithms enumerate nondominated paths with distinct capacity, and then ...






Comments