Affiliation:
1. University of Illinois at Urbana-Champaign
2. The University of Texas at Austin
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.
Funder
National Science Foundation
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference9 articles.
1. A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science'99. A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science'99 .
2. Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems
3. Galois System. http://iss.ices.utexas.edu/?p=projects/galois. Galois System. http://iss.ices.utexas.edu/?p=projects/galois.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献