Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture

  title={Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture},
  author={Joseph R. Crobak and Jonathan W. Berry and Kamesh Madduri and David A. Bader},
  journal={2007 IEEE International Parallel and Distributed Processing Symposium},
We present a study of multithreaded implementations of Thorup's algorithm for solving the single source shortest path (SSSP) problem for undirected graphs. Our implementations leverage the fledgling multithreaded graph library (MTGL) to perform operations such as finding connected components and extracting induced subgraphs. To achieve good parallel performance from this algorithm, we deviate from several theoretically optimal algorithmic steps. In this paper, we present simplifications that… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 18 extracted citations

Efficient implementation of the Bellman-Ford algorithm on GPU

2017 IEEE 4th International Conference on Knowledge-Based Engineering and Innovation (KBEI) • 2017
View 1 Excerpt

Parallel implementation of Bellman-ford algorithm using CUDA architecture

2017 International conference of Electronics, Communication and Aerospace Technology (ICECA) • 2017
View 2 Excerpts

An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures

IEEE Transactions on Parallel and Distributed Systems • 2016
View 1 Excerpt


Publications referenced by this paper.
Showing 1-10 of 15 references

9th DIMACS implementation challenge – Shortest Paths

C. Demetrescu, A. Goldberg, D. Johnson
http://www.∼challenge9/, • 2006
View 2 Excerpts

Graph software development and performance on the MTA-2 and Eldorado

J. Berry, B. Hendrickson, S. Kahan, P. Konecny
In Proc. Cray User Group meeting (CUG • 2006
View 2 Excerpts

Similar Papers

Loading similar papers…