Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems

We consider the single-source shortest path (SSSP) problem: given an undirected graph with integer edge weights and a source vertex <inline-formula><tex-math notation="LaTeX">v</tex-math> <inline-graphic xlink:href="chakaravarthy-ieq1-2634535.gif"/> </i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on parallel and distributed systems Jg. 28; H. 7; S. 2031 - 2045
Hauptverfasser: Chakaravarthy, Venkatesan T., Checconi, Fabio, Murali, Prakash, Petrini, Fabrizio, Sabharwal, Yogish
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.07.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithm design and analysis
Algorithms
Apexes
Benchmark testing
Blogs
Communications traffic
delta stepping
distributed system
graph 500 benchmark
Graph theory
Graphs
Load management
parallel algorithm
Parallel algorithms
Pruning
Shortest path
Shortest-path problems
Very large scale integration
ISSN:1045-9219, 1558-2183
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract We consider the single-source shortest path (SSSP) problem: given an undirected graph with integer edge weights and a source vertex <inline-formula><tex-math notation="LaTeX">v</tex-math> <inline-graphic xlink:href="chakaravarthy-ieq1-2634535.gif"/> </inline-formula>, find the shortest paths from <inline-formula><tex-math notation="LaTeX">v</tex-math> <inline-graphic xlink:href="chakaravarthy-ieq2-2634535.gif"/> </inline-formula> to all other vertices. In this paper, we introduce a novel parallel algorithm, derived from the Bellman-Ford and Delta-stepping algorithms. We employ various pruning techniques, such as edge classification and direction-optimization, to dramatically reduce inter-node communication traffic, and we propose load balancing strategies to handle higher-degree vertices. These techniques are particularly effective on power-law graphs, as demonstrated by our extensive performance analysis. In the largest tested configuration, an R-MAT graph with <inline-formula><tex-math notation="LaTeX">2^{38}</tex-math> <inline-graphic xlink:href="chakaravarthy-ieq3-2634535.gif"/> </inline-formula> vertices and <inline-formula><tex-math notation="LaTeX">2^{42}</tex-math> <inline-graphic xlink:href="chakaravarthy-ieq4-2634535.gif"/> </inline-formula> edges on 32,768 Blue Gene/Q nodes, we have achieved a processing rate of three Trillion Edges Per Second (TTEPS), a four orders of magnitude improvement over the best published results.
AbstractList We consider the single-source shortest path (SSSP) problem: given an undirected graph with integer edge weights and a source vertex <inline-formula><tex-math notation="LaTeX">v</tex-math> <inline-graphic xlink:href="chakaravarthy-ieq1-2634535.gif"/> </inline-formula>, find the shortest paths from <inline-formula><tex-math notation="LaTeX">v</tex-math> <inline-graphic xlink:href="chakaravarthy-ieq2-2634535.gif"/> </inline-formula> to all other vertices. In this paper, we introduce a novel parallel algorithm, derived from the Bellman-Ford and Delta-stepping algorithms. We employ various pruning techniques, such as edge classification and direction-optimization, to dramatically reduce inter-node communication traffic, and we propose load balancing strategies to handle higher-degree vertices. These techniques are particularly effective on power-law graphs, as demonstrated by our extensive performance analysis. In the largest tested configuration, an R-MAT graph with <inline-formula><tex-math notation="LaTeX">2^{38}</tex-math> <inline-graphic xlink:href="chakaravarthy-ieq3-2634535.gif"/> </inline-formula> vertices and <inline-formula><tex-math notation="LaTeX">2^{42}</tex-math> <inline-graphic xlink:href="chakaravarthy-ieq4-2634535.gif"/> </inline-formula> edges on 32,768 Blue Gene/Q nodes, we have achieved a processing rate of three Trillion Edges Per Second (TTEPS), a four orders of magnitude improvement over the best published results.
We consider the single-source shortest path (SSSP) problem: given an undirected graph with integer edge weights and a source vertex [Formula Omitted], find the shortest paths from [Formula Omitted] to all other vertices. In this paper, we introduce a novel parallel algorithm, derived from the Bellman-Ford and Delta-stepping algorithms. We employ various pruning techniques, such as edge classification and direction-optimization, to dramatically reduce inter-node communication traffic, and we propose load balancing strategies to handle higher-degree vertices. These techniques are particularly effective on power-law graphs, as demonstrated by our extensive performance analysis. In the largest tested configuration, an R-MAT graph with [Formula Omitted] vertices and [Formula Omitted] edges on 32,768 Blue Gene/Q nodes, we have achieved a processing rate of three Trillion Edges Per Second (TTEPS), a four orders of magnitude improvement over the best published results.
Author Checconi, Fabio
Sabharwal, Yogish
Murali, Prakash
Chakaravarthy, Venkatesan T.
Petrini, Fabrizio
Author_xml – sequence: 1
  givenname: Venkatesan T.
  surname: Chakaravarthy
  fullname: Chakaravarthy, Venkatesan T.
  email: vechakra@in.ibm.com
  organization: IBM Research, Vasant Kunj, New Delhi, India
– sequence: 2
  givenname: Fabio
  surname: Checconi
  fullname: Checconi, Fabio
  email: fchecco@us.ibm.com
  organization: IBM Thomas J. Watson Research Center, Yorktown Heights, NY
– sequence: 3
  givenname: Prakash
  surname: Murali
  fullname: Murali, Prakash
  email: prakmura@in.ibm.com
  organization: IBM Research, Vasant Kunj, New Delhi, India
– sequence: 4
  givenname: Fabrizio
  surname: Petrini
  fullname: Petrini, Fabrizio
  email: fabrizio.petrini@intel.com
  organization: IBM Thomas J. Watson Research Center, Yorktown Heights, NY
– sequence: 5
  givenname: Yogish
  surname: Sabharwal
  fullname: Sabharwal, Yogish
  email: ysabharwal@in.ibm.com
  organization: IBM Research, Vasant Kunj, New Delhi, India
BookMark eNp9UE1LAzEUDFLBtvoDxMuC563J5vtY6idULWw9L9k126akm5qkQv-9WVo8ePA0jzcz7w0zAoPOdRqAawQnCEF5t1zcl5MCIjYpGCYU0zMwRJSKvEACD9IMCc1lgeQFGIWwgRARCskQvJWNsqq2OitNt-rB7X2TYO181CFmCxXX2dSunDdxvQ1Z63z2qkIw39oeEuuVtdpm5SFEvQ2X4LxVNuirE47Bx-PDcvacz9-fXmbTed4UEsdcMY0QhYxIzDCFRS1qiQirIf9kdc0Fo5KmpWiggjVhHPJGcIpVyzXBooZ4DG6Pd3fefe1TzmqTcnfpZVUgTgiTRPYqflQ13oXgdVs1JqpoXBe9MrZCsOrLq_ryqr686lRecqI_zp03W-UP_3pujh6jtf7Vc86wSOwPNbZ7Dg
CODEN ITDSEO
CitedBy_id crossref_primary_10_1007_s42452_020_2635_1
crossref_primary_10_1109_TNSM_2017_2761777
crossref_primary_10_1080_13658816_2024_2431906
crossref_primary_10_1109_TC_2022_3157525
crossref_primary_10_1080_13658816_2019_1660781
crossref_primary_10_1007_s10586_019_02940_2
crossref_primary_10_3390_math11234806
crossref_primary_10_3390_a16110505
crossref_primary_10_1145_3676846
crossref_primary_10_1109_TPDS_2025_3563849
crossref_primary_10_1007_s12065_025_01079_x
crossref_primary_10_1145_3564593
crossref_primary_10_1109_TBDATA_2019_2921358
crossref_primary_10_1109_TPDS_2024_3453872
crossref_primary_10_3390_electronics13132502
crossref_primary_10_1109_TWC_2021_3100573
crossref_primary_10_1016_j_comnet_2020_107096
crossref_primary_10_1002_ett_3786
Cites_doi 10.14778/2140436.2140442
10.1109/ICPP.2009.60
10.1016/j.jda.2007.08.003
10.1109/IPPS.1997.580979
10.1109/IPDPS.2011.89
10.1007/978-3-540-39658-1_69
10.1137/1.9781611972870.3
10.1002/net.3230090304
10.1137/1.9781611972740.43
10.1145/2063384.2063419
10.1145/316542.316548
10.1109/SC.2012.50
10.1109/SC.2012.25
10.1007/978-3-540-77220-0_21
10.1109/IPDPS.2014.52
10.1080/0022250X.2001.9990249
10.1007/BF02523680
10.1016/j.parco.2011.02.004
10.1016/S0196-6774(03)00076-2
10.1007/978-3-540-68552-4_24
10.1145/2588555.2610495
10.1109/ICPP.2006.34
10.1145/28869.28874
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/TPDS.2016.2634535
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE/IET Electronic Library
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1558-2183
EndPage 2045
ExternalDocumentID 10_1109_TPDS_2016_2634535
7763835
Genre orig-research
GrantInformation_xml – fundername: Office of Science
  funderid: 10.13039/100006132
– fundername: U.S. Department of Energy
  grantid: DE-AC02-06CH11357
  funderid: 10.13039/100000015
– fundername: Argonne National Laboratory
  funderid: 10.13039/100006224
GroupedDBID --Z
-~X
.DC
0R~
29I
4.4
5GY
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACIWK
AENEX
AGQYO
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
HZ~
IEDLZ
IFIPE
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
PQQKQ
RIA
RIE
RNS
TN5
TWZ
UHB
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
RIG
ID FETCH-LOGICAL-c293t-a6e1150649363502b8b9146b07d6bb7865952b88c0a0b46707c8753af7e438b03
IEDL.DBID RIE
ISICitedReferencesCount 42
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000403455600017&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1045-9219
IngestDate Sun Jun 29 16:52:33 EDT 2025
Sat Nov 29 03:36:10 EST 2025
Tue Nov 18 22:30:52 EST 2025
Wed Aug 27 02:52:20 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 7
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c293t-a6e1150649363502b8b9146b07d6bb7865952b88c0a0b46707c8753af7e438b03
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2174469490
PQPubID 85437
PageCount 15
ParticipantIDs proquest_journals_2174469490
ieee_primary_7763835
crossref_citationtrail_10_1109_TPDS_2016_2634535
crossref_primary_10_1109_TPDS_2016_2634535
PublicationCentury 2000
PublicationDate 2017-July-1
2017-7-1
20170701
PublicationDateYYYYMMDD 2017-07-01
PublicationDate_xml – month: 07
  year: 2017
  text: 2017-July-1
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on parallel and distributed systems
PublicationTitleAbbrev TPDS
PublicationYear 2017
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref15
ref14
ref11
ref10
ref1
ref17
ref16
ref19
ref18
(ref24) 0
ref23
ref26
leskovec (ref5) 2010; 11
ref20
ref22
ref21
kleinberg (ref2) 2006
ref28
ref29
ref8
ref7
ref4
ref3
ref6
gonzalez (ref25) 2012
edmonds (ref9) 2006
(ref27) 0
References_xml – ident: ref28
  doi: 10.14778/2140436.2140442
– ident: ref10
  doi: 10.1109/ICPP.2009.60
– start-page: 17
  year: 2012
  ident: ref25
  article-title: PowerGraph: Distributed graph-parallel computation on natural graphs
  publication-title: Proc 10th USENIX Conf Oper Syst Des Implementation
– ident: ref15
  doi: 10.1016/j.jda.2007.08.003
– ident: ref12
  doi: 10.1109/IPPS.1997.580979
– ident: ref18
  doi: 10.1109/IPDPS.2011.89
– ident: ref16
  doi: 10.1007/978-3-540-39658-1_69
– ident: ref7
  doi: 10.1137/1.9781611972870.3
– ident: ref22
  doi: 10.1002/net.3230090304
– ident: ref4
  doi: 10.1137/1.9781611972740.43
– ident: ref26
  doi: 10.1145/2063384.2063419
– ident: ref13
  doi: 10.1145/316542.316548
– ident: ref6
  doi: 10.1109/SC.2012.50
– ident: ref21
  doi: 10.1109/SC.2012.25
– year: 2006
  ident: ref2
  publication-title: Algorithm Design
– year: 2006
  ident: ref9
  article-title: Single source shortest paths with the parallel boost graph library
– ident: ref20
  doi: 10.1007/978-3-540-77220-0_21
– ident: ref23
  doi: 10.1109/IPDPS.2014.52
– ident: ref1
  doi: 10.1080/0022250X.2001.9990249
– year: 0
  ident: ref24
– ident: ref14
  doi: 10.1007/BF02523680
– volume: 11
  start-page: 985
  year: 2010
  ident: ref5
  article-title: Kronecker graphs: An approach to modeling networks
  publication-title: J Mach Learn Res
– ident: ref11
  doi: 10.1016/j.parco.2011.02.004
– ident: ref3
  doi: 10.1016/S0196-6774(03)00076-2
– ident: ref17
  doi: 10.1007/978-3-540-68552-4_24
– ident: ref29
  doi: 10.1145/2588555.2610495
– year: 0
  ident: ref27
– ident: ref19
  doi: 10.1109/ICPP.2006.34
– ident: ref8
  doi: 10.1145/28869.28874
SSID ssj0014504
Score 2.4293742
Snippet We consider the single-source shortest path (SSSP) problem: given an undirected graph with integer edge weights and a source vertex <inline-formula><tex-math...
We consider the single-source shortest path (SSSP) problem: given an undirected graph with integer edge weights and a source vertex [Formula Omitted], find the...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 2031
SubjectTerms Algorithm design and analysis
Algorithms
Apexes
Benchmark testing
Blogs
Communications traffic
delta stepping
distributed system
graph 500 benchmark
Graph theory
Graphs
Load management
parallel algorithm
Parallel algorithms
Pruning
Shortest path
Shortest-path problems
Very large scale integration
Title Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems
URI https://ieeexplore.ieee.org/document/7763835
https://www.proquest.com/docview/2174469490
Volume 28
WOSCitedRecordID wos000403455600017&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1558-2183
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014504
  issn: 1045-9219
  databaseCode: RIE
  dateStart: 19900101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDLY2xAEOvBHjpRw4IbqFJm2aIwImDjBN2kC7VW0W2KSyoa1D4t9jZ9lAAiFx6iuRqrq2Pye2P4AzkUVKRiGVKMdRIE0uicjdBkk_ykRsEUI4ms6ne9VqJb2eblfgYlkLY611yWe2TqduL78_NjNaKmsoVAZEDFWoKqXmtVrLHQMZOapAjC6iQKMa-h3MS64b3fZNh5K44noYCxk5ZrcvH-RIVX5YYudempv_e7Et2PAwkl3N5b4NFTvagc0FRQPzGrsD69_6De5Cq4MSoVop1sFrOrile9YZUMrttGRtxIPsqngZT4bl4HXKENGyB4TXaBKLD3w6IeaVgvk253vw2LztXt8FnlAhMOjVyyCLLQHAWGqBOIOHeZJrtJQ5V_04z1VCvQXxZmJ4xnO0oFwZCmeyZ2WlSHIu9mFlNB7ZA2BWGIIuhkdZKIXUmbjMVP_ZCuoGhJiuBnzxiVPju40T6UWRuqiD65SkkpJUUi-VGpwvp7zNW238NXiXxLAc6CVQg-OFHFOvjNOUoi4Za6n54e-zjmAtJG_tsnCPYaWczOwJrJr3cjidnLr_7BOfbczL
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB58gXrwLVar5uBJXE03ye7mKGqp2JZCq3hbdtP4gNpKuwr-e2fStAqK4GlfCSw7OzPfJDPzARyJTMVShVSiHKlAmlwSkbsNkq7KRGQRQjiazrt63Gwm9_e6NQMn01oYa61LPrOndOr28rsD80ZLZWcxKgMihlmYV1KGlXG11nTPQCpHFojxhQo0KqLfw6xwfdZpXbYpjSs6DSMhleN2-_JCjlblhy12Dqa6-r9XW4MVDyTZ-Vjy6zBj-xuwOiFpYF5nN2D5W8fBTWi2USZULcXaeE0Ht3jP2k-UdDsqWAsRITvvPQ6Gz8XTy4ghpmUNBNhoFHsf-HRI3Cs95hudb8Ft9apzUQs8pUJg0K8XQRZZgoCR1AKRBg_zJNdoK3Med6M8jxPqLog3E8MznqMN5bGhgCZ7iK0USc7FNsz1B327A8wKQ-DFcJWFUkidiUoWdx-soH5AiOpKwCefODW-3zjRXvRSF3dwnZJUUpJK6qVSguPplNdxs42_Bm-SGKYDvQRKUJ7IMfXqOEop7pKRlprv_j7rEBZrnUY9rV83b_ZgKSTf7XJyyzBXDN_sPiyY9-J5NDxw_9wncabQEg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Scalable+Single+Source+Shortest+Path+Algorithms+for+Massively+Parallel+Systems&rft.jtitle=IEEE+transactions+on+parallel+and+distributed+systems&rft.au=Chakaravarthy%2C+Venkatesan+T.&rft.au=Checconi%2C+Fabio&rft.au=Murali%2C+Prakash&rft.au=Petrini%2C+Fabrizio&rft.date=2017-07-01&rft.pub=IEEE&rft.issn=1045-9219&rft.volume=28&rft.issue=7&rft.spage=2031&rft.epage=2045&rft_id=info:doi/10.1109%2FTPDS.2016.2634535&rft.externalDocID=7763835
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1045-9219&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1045-9219&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1045-9219&client=summon