Abstract
We develop an efficient parallel algorithm for answering shortest-path queries in planar graphs and implement it on a multi-node CPU-GPU clusters. The algorithm uses a divide-and-conquer approach for decomposing the input graph into small and roughly equal subgraphs and constructs a distributed data structure containing shortest distances within each of those subgraphs and between their boundary vertices. For a planar graph with n vertices, that data structure needs O(n) storage per processor and allows queries to be answered in \(O(n^{1/4})\) time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Chen, D.Z., Xu, J.: Shortest path queries in planar graphs. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, STOC 2000, pp. 469–478. ACM, New York (2000)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)
Djidjev, H.: Efficient algorithms for shortest path queries in planar digraphs. In: d’Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds.) Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science, vol. 1197, pp. 151–165. Springer, Heidelberg (1997)
Djidjev, H., Chapuis, G.: Shortest-path queries in planar graphs on GPU-accelerated architectures (arXiv). CoRR (2015). http://arxiv.org
Djidjev, H., Thulasidasan, S., Chapuis, G., Andonov, R., Lavenier, D.: Efficient multi-GPU computation of all-pairs shortest paths. In: IPDPS, pp. 360–369 (2014)
Frederickson, G.N.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput. 16(6), 1004–1022 (1987)
Frederickson, G.N.: Planar graph decomposition and all pairs shortest paths. J. ACM 38(1), 162–204 (1991)
Karypis, G., Kumar, V.: Multilevel k-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput. 48(1), 96–129 (1998)
Mozes, S., Sommer, C.: Exact distance oracles for planar graphs. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 209–222 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Chapuis, G., Djidjev, H. (2015). Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2015. Lecture Notes in Computer Science(), vol 9374. Springer, Cham. https://doi.org/10.1007/978-3-319-26520-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-26520-9_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26519-3
Online ISBN: 978-3-319-26520-9
eBook Packages: Computer ScienceComputer Science (R0)