research-article

ParaPLL: Fast Parallel Shortest-path Distance Query on Large-scale Weighted Graphs

Authors:

Tilman WolfAuthors Info & Claims

ICPP '18: Proceedings of the 47th International Conference on Parallel Processing

Article No.: 2, Pages 1 - 10

https://doi.org/10.1145/3225058.3225061

Published: 13 August 2018 Publication History

Abstract

Determining the shortest-path distance between vertices in the weighted graph is an important problem for a broad range of fields, such as context-aware search and route selection. While many efficient methods for querying shortest-path distance have been proposed, they are poorly suited for parallel architectures, such as multi-core CPUs or computer clusters, due to the strong task dependencies. In this paper, we propose ParaPLL, a new parallelism-friendly framework for fast shortest-path distance query on large-scale weighted graphs. ParaPLL exploits intra-node and inter-node parallelism by using shared memory and message passing paradigms respectively. We also design task assignment and synchronization policies, which allow ParaPLL to reach remarkable speedups compared to state-of-the-art solutions. Moreover, we also prove the correctness of ParaPLL. To the best of our knowledge, ParaPLL is the first parallel framework that utilizing pruned landmark labeling to accelerate shortest-path distance queries on large-scale weighted graphs. Our evaluation results show that ParaPLL is 9.46 times faster than the corresponding serial version on a weighted 0.3M-vertex graph using a 12-core computer. ParaPLL on a 6-node computer cluster can also achieve a speedup of up to 5.6 over the single-node implementation.

References

[1]

2018. CAIDA. (2018). http://www.caida.org/data

[2]

2018. USA Road Network. (2018). http://www.diag.uniroma1.it/challenge9/data/tiger/

[3]

2018. Xeon X5680 Benchmark. (2018). http://ranker.sisoftware.net/

[4]

Takuya Akiba, Yoichi Iwata, and Yuichi Yoshida. 2013. Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data. ACM, 349--360.

Digital Library

[5]

Lars Backstrom, Dan Huttenlocher, Jon Kleinberg, and Xiangyang Lan. 2006. Group formation in large social networks: membership, growth, and evolution. In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 44--54.

Digital Library

[6]

Randeep Bhatia, Fang Hao, Murali Kodialam, and TV Lakshman. 2015. Optimized network traffic engineering using segment routing. In Computer Communications (INFOCOM), 2015 IEEE Conference on. IEEE, 657--665.

[7]

Venkatesan T Chakaravarthy, Fabio Checconi, Prakash Murali, Fabrizio Petrini, and Yogish Sabharwal. 2017. Scalable single source shortest path algorithms for massively parallel systems. IEEE Transactions on Parallel and Distributed Systems 28, 7 (2017), 2031--2045.

Digital Library

[8]

Yurong Cheng, Ye Yuan, Lei Chen, Guoren Wang, Christophe Giraud-Carrier, and Yongjiao Sun. 2016. Distr: a distributed method for the reachability query over large uncertain graphs. IEEE Transactions on Parallel and Distributed Systems 27, 11 (2016), 3172--3185.

Digital Library

[9]

Edith Cohen, Eran Halperin, Haim Kaplan, and Uri Zwick. 2003. Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32, 5 (2003), 1338--1355.

Digital Library

[10]

Thomas H Cormen. 2009. Introduction to algorithms. MIT press.

[11]

Damir Ferizovic.2015. Parallel Pruned Landmark Labeling for Shortest Path Queries on Unit-Weight Networks. Ph.D. Dissertation. National Research Center.

[12]

Ada Wai-Chee Fu, Huanhuan Wu, James Cheng, and Raymond Chi-Wing Wong. 2013. Is-label: an independent-set based labeling scheme for point-to-point distance querying. Proceedings of the VLDB Endowment 6, 6 (2013), 457--468.

Digital Library

[13]

Ruoming Jin, Ning Ruan, Yang Xiang, and Victor Lee. 2012. A highway-centric labeling approach for answering distance queries on large sparse graphs. In Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data. ACM, 445--456.

Digital Library

[14]

Jure Leskovec, Daniel Huttenlocher, and Jon Kleinberg. 2010. Predicting positive and negative links in online social networks. In Proceedings of the 19th international conference on World wide web. ACM, 641--650.

Digital Library

[15]

Jure Leskovec, Jon Kleinberg, and Christos Faloutsos. 2007. Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data (TKDD) 1, 1 (2007), 2.

Digital Library

[16]

Grzegorz Malewicz, Matthew H Austern, Aart JC Bik, James C Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. 2010. Pregel: a system for large-scale graph processing. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of data. ACM, 135--146.

Digital Library

[17]

Ashwin Paranjape, Austin R Benson, and Jure Leskovec. 2017. Motifs in temporal networks. In Proceedings of the Tenth ACM International Conference on Web Search and Data Mining. ACM, 601--610.

Digital Library

[18]

Michalis Potamias, Francesco Bonchi, Carlos Castillo, and Aristides Gionis. 2009. Fast shortest path distance estimation in large networks. In Proceedings of the 18th ACM conference on Information and knowledge management. ACM, 867--876.

Digital Library

[19]

Kun Qiu, Siyuan Huang, Qiongwen Xu, Jin Zhao, Xin Wang, and Stefano Secci. 2017. ParaCon: A Parallel Control Plane for Scaling Up Path Computation in SDN. IEEE Transactions on Network and Service Management 14, 4 (2017), 978--990.

Digital Library

[20]

Matthew Richardson, Rakesh Agrawal, and Pedro Domingos. 2003. Trust management for the semantic web. In International semantic Web conference. Springer, 351--368.

Digital Library

[21]

Antti Ukkonen, Carlos Castillo, Debora Donato, and Aristides Gionis. 2008. Searching the wikipedia with contextual information. In Proceedings of the 17th ACM conference on Information and knowledge management. ACM, 1351--1352.

Digital Library

[22]

Kai Wang, Guoqing (Harry) Xu, Zhendong Su, and Yu David Liu. 2015. GraphQ: Graph Query Processing with Abstraction Refinement-Scalable and Programmable Analytics over Very Large Graphs on a Single PC. In USENIX Annual Technical Conference. 387--401.

Digital Library

[23]

Fang Wei. 2010. TEDI: efficient shortest path query answering on graphs. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of data. ACM, 99--110.

Digital Library

[24]

Qiongwen Xu, Xu Zhang, Jin Zhao, Xin Wang, and Tilman Wolf. 2016. Fast shortest-path queries on large-scale graphs. In Network Protocols (ICNP), 2016 IEEE 24th International Conference on. IEEE, 1--10.

[25]

Sihem Amer Yahia, Michael Benedikt, Laks VS Lakshmanan, and Julia Stoyanovich. 2008. Efficient network aware search in collaborative tagging sites. Proceedings of the VLDB Endowment 1, 1 (2008), 710--721.

Digital Library

[26]

Xiaofei Zhang and Lei Chen. 2017. Distance-aware selective online query processing over large distributed graphs. Data Science and Engineering 2, 1 (2017), 2--21.

[27]

Lei Zou, M Tamer Özsu, Lei Chen, Xuchuan Shen, Ruizhe Huang, and Dongyan Zhao. 2014. gStore: a graph-based SPARQL query engine. The VLDB journal 23, 4 (2014), 565--590.

Digital Library

Cited By

Yu ZYu XKoudas NChen YLiu Y(2024) A Distributed Solution for Efficient K Shortest Paths Computation Over Dynamic Road Networks IEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.3346377(1-14)Online publication date: 2024
https://doi.org/10.1109/TKDE.2023.3346377
Jin RPeng ZWu WDragan FAgrawal GRen BAyguadé EHwu WBadia RHofstee H(2020)Parallelizing pruned landmark labelingProceedings of the 34th ACM International Conference on Supercomputing10.1145/3392717.3392745(1-13)Online publication date: 29-Jun-2020
https://dl.acm.org/doi/10.1145/3392717.3392745
Yu ZYu XKoudas NLiu YLi YChen YYang DMaier DPottinger RDoan ATan WAlawini ANgo H(2020)Distributed Processing of k Shortest Path Queries over Dynamic Road NetworksProceedings of the 2020 ACM SIGMOD International Conference on Management of Data10.1145/3318464.3389735(665-679)Online publication date: 11-Jun-2020
https://dl.acm.org/doi/10.1145/3318464.3389735

Index Terms

ParaPLL: Fast Parallel Shortest-path Distance Query on Large-scale Weighted Graphs
1. Computing methodologies
  1. Parallel computing methodologies
    1. Parallel algorithms
      1. Massively parallel algorithms
2. Theory of computation
  1. Design and analysis of algorithms
    1. Graph algorithms analysis
      1. Shortest paths

Recommendations

A Detailed Performance Analysis of the Interpolation Supplemented Lattice Boltzmann Method on the Cray T3E and Cray X1A Detailed Performance Analysis of the Interpolation Supplemented Lattice Boltzmann Method on the Cray T3E and Cray X1

A detailed study of the parallel performance of the interpolation supplemented lattice Boltzmann (ISLB) method using SHMEM and MPI on the Cray T3E-900 and Cray X1 architectures is presented. The noteworthy feature of the ...
Exploiting Distributed-Memory and Shared-Memory Parallelism on Clusters of SMPs with Data Parallel Programs

Clusters of SMPs are hybrid-parallel architectures that combine the main concepts of distributed-memory and shared-memory parallel machines. Although SMP clusters are widely used in the high performance computing community, there exists no single ...
Compiling data-parallel programs for clusters of SMPs: Research Articles
Compilers for Parallel Computers

Clusters of shared-memory multiprocessors (SMPs) have become the most promising parallel computing platforms for scientific computing. However, SMP clusters significantly increase the complexity of user application development when using the low-level ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

ICPP '18: Proceedings of the 47th International Conference on Parallel Processing

August 2018

945 pages

ISBN:9781450365109

DOI:10.1145/3225058

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

University of Oregon: University of Oregon

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 August 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

ICPP 2018

ICPP 2018: 47th International Conference on Parallel Processing

August 13 - 16, 2018

OR, Eugene, USA

Acceptance Rates

ICPP '18 Paper Acceptance Rate 91 of 313 submissions, 29%;

Overall Acceptance Rate 91 of 313 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
311
Total Downloads

Downloads (Last 12 months)25
Downloads (Last 6 weeks)7

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Yu ZYu XKoudas NChen YLiu Y(2024) A Distributed Solution for Efficient K Shortest Paths Computation Over Dynamic Road Networks IEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.3346377(1-14)Online publication date: 2024
https://doi.org/10.1109/TKDE.2023.3346377
Jin RPeng ZWu WDragan FAgrawal GRen BAyguadé EHwu WBadia RHofstee H(2020)Parallelizing pruned landmark labelingProceedings of the 34th ACM International Conference on Supercomputing10.1145/3392717.3392745(1-13)Online publication date: 29-Jun-2020
https://dl.acm.org/doi/10.1145/3392717.3392745
Yu ZYu XKoudas NLiu YLi YChen YYang DMaier DPottinger RDoan ATan WAlawini ANgo H(2020)Distributed Processing of k Shortest Path Queries over Dynamic Road NetworksProceedings of the 2020 ACM SIGMOD International Conference on Management of Data10.1145/3318464.3389735(665-679)Online publication date: 11-Jun-2020
https://dl.acm.org/doi/10.1145/3318464.3389735

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents