In application areas such as geographical information systems, the Euclidean metric is often less meaningfully applied to determine a shortest path than metrics which capture, through weights, the varying nature of the terrain (e.g., water, rock, forest). Considering weighted metrics, however, increases the run-time of algorithms considerably suggesting the use of a parallel approach. In this paper, we provide a parallel implementation of shortest path algorithms for the Euclidean and weighted metrics on triangular irregular networks (i.e., a triangulated point set in which each point has an associated height value). To the best of our knowledge, this is the first parallel implementation of shortest path problems in these metrics. We provide a detailed discussion of the algorithmic issues and the factors related to data, machine, implementation which determine the performance of parallel shortest path algorithms. We describe our parallel algorithm for weighted shortest paths, its implementation and performance for single- and multiple-source instances. Our experiments were performed on standard architectures with different communication/computation characteristics, including PCs interconnected by a cross-bar switch using fast ethernet, a state-of-the-art Beowulf cluster with gigabit interconnect and a shared-memory architecture, SunFire.

Additional Metadata
Keywords Domain (data) partitioning, GIS, Parallel computing, Shortest paths, TIN processing
Persistent URL dx.doi.org/10.1016/j.parco.2003.05.004
Journal Parallel Computing
Citation
Lanthier, M, Nussbaum, D, & Sack, J.-R. (2003). Parallel implementation of geometric shortest path algorithms. In Parallel Computing (Vol. 29, pp. 1445–1479). doi:10.1016/j.parco.2003.05.004