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}
}
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.

118 Citations

01020'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 118 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 34 REFERENCES

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

  • J. Berry, B. Hendrickson, S. Kahan, P. Konecny
  • Proc. Cray User Group meeting (CUG ). CUG…
  • 2006
3 Excerpts

The structure and function of complex networks

  • M. Newman
  • SIAM Review 45, 2, 167–256.
  • 2003
2 Excerpts

Similar Papers

Loading similar papers…