Elsevier

Parallel Computing

Volume 21, Issue 9, September 1995, Pages 1505-1532
Parallel Computing

Partical aspect and experience
An experimental comparison of two distributed single-source shortest path algorithms

https://doi.org/10.1016/0167-8191(95)00025-JGet rights and content

Abstract

We experimentally compare two distributed algorithms based on Dijkstra's algorithm for the single-source shortest path problem. The algorithms are intended for asynchronous distributed systems with a small number of processors without shared memory, and specifically address the situation where communication is costly. Variations of the algorithms have been implemented in occam, and results from experiments on a 16 processor transputer system with randomly generated graphs of different types and densities with up to 20000 vertices and 250000 edges are reported.

The distributed algorithms exploit the two obvious sources of parallelism in Dijkstra's algorithm. In the update-driven algorithm several vertices may be selected and scanned simultaneously. Since not all selected vertices can be guaranteed to be correct, the achievable speed-up depends on the problem instance, and no worst-case guarantee better than the sequential algorithm can be given. In contrast the minimum-driven algorithm performs the scanning in parallel but from only one selected vertex at a time. Ideally this algorithm has linear speed-up for dense graphs. Implemented naively both algorithms perform poorly, but can be improved by relaxations and approximations which reduce communication volume. In all cases the theoretically less attractive update-driven algorithm turns out to perform much better than the apparently preferable minimum-driven algorithm.

References (28)

  • B.V. Cherkassky et al.

    Shortest path algorithms: Theory and experimental evaluation

  • J. Clausen et al.

    Distributed shortest path algorithms based on token passing

  • M. Debbage et al.

    Developed within the Esprit P2701 PUMA project

  • J.R. Driscoll et al.

    Relaxed heaps: An alternative to fibonacci heaps with applications to parallel computation

    Commun. ACM

    (1988)
  • Cited by (20)

    • Parallel implementation of a transportation network model

      2005, Journal of Parallel and Distributed Computing
    • Termination Detection for Parallel Shortest Path Algorithms

      1998, Journal of Parallel and Distributed Computing
    View all citing articles on Scopus

    Author's current address: Max-Planck Institut für Informatik, Im Stadtwald, D-66123 Saarbrücken, Germany.

    View full text