Highly Influenced

# An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances

@inproceedings{Madduri2007AnES, title={An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances}, author={Kamesh Madduri and David A. Bader and Jonathan W. Berry and Joseph R. Crobak}, booktitle={ALENEX}, year={2007} }

- Published in ALENEX 2007
DOI:10.1137/1.9781611972870.3

We present an experimental study of the single source shortest path problem with non-negative edge weights (NSSP) on largescale graphs using the Δ-stepping parallel algorithm. We report performance results on the Cray MTA-2, a multithreaded parallel computer. The MTA-2 is a high-end shared memory system offering two unique features that aid the efficient parallel implementation of irregular algorithms: the ability to exploit fine-grained parallelism, and low-overhead synchronization primitives… CONTINUE READING

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 118 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**118**citations based on the available data.See our **FAQ** for additional information.