skip to main content
research-article
Public Access

DSMR: a shared and distributed memory algorithm for single-source shortest path problem

Published:27 February 2016Publication History
Skip Abstract Section

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.

References

  1. A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science'99.Google ScholarGoogle Scholar
  2. V. Chakaravarthy, F. Checconi, F. Petrini, and Y. Sabharwal. Scalable single source shortest path algorithms for massively parallel systems. In IPDPS'14. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-mat: A recursive model for graph mining. In SDM'04.Google ScholarGoogle Scholar
  4. C. Demetrescu, A. V. Goldberg, and D. S. Johnson. Implementation challenge for shortest paths. In Encyclopedia of Algorithms'08.Google ScholarGoogle Scholar
  5. Galois System. http://iss.ices.utexas.edu/?p=projects/galois.Google ScholarGoogle Scholar
  6. U. Meyer and P. Sanders. Delta-stepping: A parallelizable shortest path algorithm. J. Algorithms'03. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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 ScholarGoogle Scholar
  8. D. Prountzos, R. Manevich, and K. Pingali. Elixir: A system for synthesizing concurrent graph programs. OOPSLA '12. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. Yang and J. Leskovec. Defining and evaluating network communities based on ground-truth. In MDS '12. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image ACM SIGPLAN Notices
    ACM SIGPLAN Notices  Volume 51, Issue 8
    PPoPP '16
    August 2016
    405 pages
    ISSN:0362-1340
    EISSN:1558-1160
    DOI:10.1145/3016078
    Issue’s Table of Contents
    • cover image ACM Conferences
      PPoPP '16: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
      February 2016
      420 pages
      ISBN:9781450340922
      DOI:10.1145/2851141

    Copyright © 2016 ACM

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 27 February 2016

    Check for updates

    Qualifiers

    • research-article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader
About Cookies On This Site

We use cookies to ensure that we give you the best experience on our website.

Learn more

Got it!