skip to main content
10.1145/2915516.2915518acmconferencesArticle/Chapter ViewAbstractPublication PageshpdcConference Proceedingsconference-collections
research-article
Public Access

Parallel Shortest-Path Queries in Planar Graphs

Published: 31 May 2016 Publication History

Abstract

We develop several parallel algorithms for shortest distance queries in planar graphs that use graph partitioning in the preprocessing phase to precompute and store distances between selected pairs of vertices. In the query phase, given a pair of arbitrary vertices v and w, the stored information is used to find the distance between v and w fast. The algorithms are implemented and tested on a high performance cluster with upto 256 16-core CPUs and their performances are analyzed and compared.

References

[1]
L. Aleksandrov, H. Djidjev, H. Guo, A. Maheshwari, D. Nussbaum, and J.-R. Sack. Approximate shortest path queries on weighted polyhedral surfaces. Discrete & Computational geometry, (44):762--801, 2010.
[2]
H. Bast, D. Delling, A. V. Goldberg, M. Müller-Hannemann, T. Pajor, P. Sanders, D. Wagner, and R. F. Werneck. Route planning in transportation networks. CoRR, abs/1504.05140, 2015.
[3]
G. Chapuis and H. Djidjev. Shortest-path queries in planar graphs on GPU-accelerated architectures. In Large-Scale Scientific Computing LSSC, volume 9374 of Lecture Notes in Computer Science, pages 53--60. Springer, 2015.
[4]
S. Chaudhuri and C. Zaroliagis. Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms. Theoretical Computer Science, 203(2):205--223, 1998.
[5]
S. Chaudhuri and C. Zaroliagis. Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms. Algorithmica, 27(3):212--226, 2000.
[6]
L. Dagum and R. Menon. OpenMP: an industry standard API for shared-memory programming. Computational Science & Engineering, IEEE, 5(1):46--55, 1998.
[7]
B. Dawes, D. Abrahams, and R. Rivera. Boost C++ libraries. http://www. boost. org, 35:36, 2009.
[8]
E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische mathematik, 1(1):269--271, 1959.
[9]
H. Djidjev. Efficient algorithms for shortest path queries in planar digraphs. In Graph-Theoretic Concepts in Computer Science, volume 1197 of Lecture Notes in Computer Science, pages 151--165. 1997.
[10]
H. N. Djidjev, L. Aleksandrov, and G. J. Chapuis. Parallel shortest-path queries in planar graphs. Technical report, Los Alamos National Laboratory, 2016.
[11]
G. N. Frederickson. Planar graph decomposition and all pairs shortest paths. Journal of ACM, 38(1):162--204, 1991.
[12]
W. Gropp, E. L. Lusk, and A. Skjellum. Using MPI-: Portable Parallel Programming with the Message Passing Interface, volume 1. MIT press, 1999.
[13]
D. Hutchinson, A. Maheshwari, and N. Zeh. An external memory data structure for shortest path queries (extended abstract). COCOON, pages 51--60, 1999.
[14]
G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on scientific Computing, 20(1):359--392, 1998.
[15]
K. Mehlhorn, S. Näher, and C. Uhrig. Leda: A platform for combinatorial and geometric computing. 38, 1999.
[16]
D. Nussbaum, J. Sack, and H. Ye. Concurrent parallel shortest path computation. In Proceedings of the International Conference ParCo, pages 277--284, 2005.
[17]
C. Sommer. Shortest-path queries in static networks. ACM Computing Surveys, 46(4):45:1--45:31, Mar. 2014.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
HPGP '16: Proceedings of the ACM Workshop on High Performance Graph Processing
May 2016
60 pages
ISBN:9781450343503
DOI:10.1145/2915516
Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.

Sponsors

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 31 May 2016

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. distance queries
  2. distributed computing
  3. graph algorithms
  4. graph partitioning
  5. shortest path problems

Qualifiers

  • Research-article

Funding Sources

  • LDRD

Conference

HPDC'16
Sponsor:

Acceptance Rates

HPGP '16 Paper Acceptance Rate 5 of 6 submissions, 83%;
Overall Acceptance Rate 5 of 6 submissions, 83%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 180
    Total Downloads
  • Downloads (Last 12 months)75
  • Downloads (Last 6 weeks)10
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media