Skip to main content
Article
A Shared-Memory Algorithm for Updating Single-Source Shortest Paths in Large Weighted Dynamic Networks
Proceedings of the 25th IEEE International Conference on High Performance Computing (2018, Bengaluru, India)
  • Sriram Srinivasan
  • Sara Riazi
  • Boyana Norris
  • Sajal K. Das, Missouri University of Science and Technology
  • Sanjukta Bhowmick
Abstract

Computing the single-source shortest path (SSSP) is one of the fundamental graph algorithms, and is used in many applications. Here, we focus on computing SSSP on large dynamic graphs, i.e. graphs whose structure evolves with time. We posit that instead of recomputing the SSSP for each set of changes on the dynamic graphs, it is more efficient to update the results based only on the region of change. To this end, we present a novel two-step shared-memory algorithm for updating SSSP on weighted large-scale graphs. The key idea of our algorithm is to identify changes, such as vertex/edge addition and deletion, that affect the shortest path computations and update only the parts of the graphs affected by the change. We provide the proof of correctness of our proposed algorithm. Our experiments on real and synthetic networks demonstrate that our algorithm is as much as 4X faster compared to computing SSSP with Galois, a state-of-the-art parallel graph analysis software for shared memory architectures. We also demonstrate how increasing the asynchrony can lead to even faster updates. To the best of our knowledge, this is one of the first practical parallel algorithms for updating networks on shared-memory systems, that is also scalable to large networks.

Meeting Name
25th IEEE International Conference on High Performance Computing, HiPC 2018 (2018: Dec. 17-20, Bengaluru, India)
Department(s)
Computer Science
Research Center/Lab(s)
Intelligent Systems Center
Keywords and Phrases
  • Dynamic Networks,
  • parallel graph algorithms,
  • Shared Memory,
  • Single-Source Shortest Path
International Standard Book Number (ISBN)
978-153868386-6
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2019 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.
Publication Date
12-1-2019
Disciplines
Citation Information
Sriram Srinivasan, Sara Riazi, Boyana Norris, Sajal K. Das, et al.. "A Shared-Memory Algorithm for Updating Single-Source Shortest Paths in Large Weighted Dynamic Networks" Proceedings of the 25th IEEE International Conference on High Performance Computing (2018, Bengaluru, India) (2019) p. 245 - 254
Available at: http://works.bepress.com/sajal-das/143/