An Adaptive Asynchronous Approach for the Single-Source Shortest Paths Problem

Large-scale graphs with billions and trillions of vertices and edges require efficient parallel algorithms for common graph problems, one of which is single-source shortest paths (SSSP). Bulk-synchronous parallel algorithms such as ∆-stepping experience large synchronization costs at the scale of ma...

Full description

Saved in:
Bibliographic Details
Published in:SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis pp. 697 - 702
Main Authors: Rao, Ritvik, Chandrasekar, Kavitha, Kale, Laxmikant
Format: Conference Proceeding
Language:English
Published: IEEE 17.11.2024
Subjects:
Conferences
Costs
graphs
High performance computing
Libraries
Monitoring
Optimization
Parallel algorithms
Scalability
Shortest path problem
sssp
Synchronization
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Large-scale graphs with billions and trillions of vertices and edges require efficient parallel algorithms for common graph problems, one of which is single-source shortest paths (SSSP). Bulk-synchronous parallel algorithms such as ∆-stepping experience large synchronization costs at the scale of many nodes, so asynchronous approaches are needed for scalability. However, asynchronous approaches are susceptible to wasteful, speculative execution. We introduce ACIC, a highly asynchronous approach modulated by continuous concurrent introspection and adaptation. Using message-driven concurrent reductions and broadcasts, task-based scheduling, and an adaptive aggregation library, we explore techniques such as evolving windows and generation and prioritized flow of optimal updates, or edge relaxations, aimed at reducing speculative loss without constraining parallelism. Our results, while preliminary, demonstrate the promise of these ideas, with the potential to impact a wider class of graph algorithms.
AbstractList Large-scale graphs with billions and trillions of vertices and edges require efficient parallel algorithms for common graph problems, one of which is single-source shortest paths (SSSP). Bulk-synchronous parallel algorithms such as ∆-stepping experience large synchronization costs at the scale of many nodes, so asynchronous approaches are needed for scalability. However, asynchronous approaches are susceptible to wasteful, speculative execution. We introduce ACIC, a highly asynchronous approach modulated by continuous concurrent introspection and adaptation. Using message-driven concurrent reductions and broadcasts, task-based scheduling, and an adaptive aggregation library, we explore techniques such as evolving windows and generation and prioritized flow of optimal updates, or edge relaxations, aimed at reducing speculative loss without constraining parallelism. Our results, while preliminary, demonstrate the promise of these ideas, with the potential to impact a wider class of graph algorithms.
Author Rao, Ritvik
Kale, Laxmikant
Chandrasekar, Kavitha
Author_xml – sequence: 1
  givenname: Ritvik
  surname: Rao
  fullname: Rao, Ritvik
  email: rsrao2@illinois.edu
  organization: University of Illinois,Urbana,IL,USA
– sequence: 2
  givenname: Kavitha
  surname: Chandrasekar
  fullname: Chandrasekar, Kavitha
  email: kchndrs2@illinois.edu
  organization: University of Illinois,Urbana,IL,USA
– sequence: 3
  givenname: Laxmikant
  surname: Kale
  fullname: Kale, Laxmikant
  email: kale@illinois.edu
  organization: University of Illinois,Urbana,IL,USA
BookMark eNotzM1KxDAUQOEICurYJ9BFXqD1JmmSZlmKfzDoQAdcDml6YwudpiQdYd5eQVeHb3NuyeUcZiTknkHBGJjHtvlUgpdQcOBlAQBGX5DMaFMJCUJKWYprkqU0dqBAViVU8oa81zOte7us4zfSOp1nN8Qwh1Oi9bLEYN1AfYh0HZC24_w1Yd6GU3S_GkJcMa10Z9ch0V0M3YTHO3Ll7ZQw---G7J-f9s1rvv14eWvqbW65VGvudaedU9aC7w1qhVixUigphZe96plQnBl0rmMeesd6ra1wwjJmuS-1ERvy8LcdEfGwxPFo4_nAoOKgVSV-ANL4UAE
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/SCW63240.2024.00097
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library Online
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9798350355543
EndPage 702
ExternalDocumentID 10820768
Genre orig-research
GroupedDBID 6IE
6IL
ACM
ALMA_UNASSIGNED_HOLDINGS
CBEJK
RIE
RIL
ID FETCH-LOGICAL-a256t-f7b7cc6aa0fd9e76ee81436553f5d6d136219eccb1f0dc1d77a3c3a11a2f4793
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001451792300075&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 01:59:34 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a256t-f7b7cc6aa0fd9e76ee81436553f5d6d136219eccb1f0dc1d77a3c3a11a2f4793
PageCount 6
ParticipantIDs ieee_primary_10820768
PublicationCentury 2000
PublicationDate 2024-Nov.-17
PublicationDateYYYYMMDD 2024-11-17
PublicationDate_xml – month: 11
  year: 2024
  text: 2024-Nov.-17
  day: 17
PublicationDecade 2020
PublicationTitle SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis
PublicationTitleAbbrev SC-W
PublicationYear 2024
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssib060584085
Score 1.8893893
Snippet Large-scale graphs with billions and trillions of vertices and edges require efficient parallel algorithms for common graph problems, one of which is...
SourceID ieee
SourceType Publisher
StartPage 697
SubjectTerms Conferences
Costs
graphs
High performance computing
Libraries
Monitoring
Optimization
Parallel algorithms
Scalability
Shortest path problem
sssp
Synchronization
Title An Adaptive Asynchronous Approach for the Single-Source Shortest Paths Problem
URI https://ieeexplore.ieee.org/document/10820768
WOSCitedRecordID wos001451792300075&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
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEF5s8eBJxYpv9uB1dTevzR5DsXiQUEjR3spmHyhIWppU8N87s03ViwdvIZANzD7mm9n5viHkFkB06mSdMq-4ZwlgAKYiXjObOpXk1tYi5CGfn2RZ5vO5mvZk9cCFcc6F4jN3h4_hLt8uzQZTZbDDwV8BPh6QgZRyS9baLR683kO1rl5ZSHB1X41fUIycQxQYoUZ2UHb61UMluJDJ4T9_fkRGP2Q8Ov12M8dkzzUnpCwaWli9wsOKFu1nY1DkFqJ4WvQi4RTQKAV0Ryv46t2xKmTpafWK1bVtR6cA_VocGPvJjMhs8jAbP7K-NQLTgFE65mUtjcm05t4qJzPncgA-WZrGPrWZFeCWhILZqYXn1ggrpY5NrIXQkcdc2ikZNsvGnRGqIWCxsc1d5pIkkkJzXfuEe5PkxhupzskIbbFYbcUvFjszXPzx_pIcoLmRrifkFRl26427Jvvmo3tr1zdhyr4AosqYqA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA5aBT2pWLE-c_AaTfaVzXEplop1KWzR3ko2DxRkW7pbwX_vJN2qFw_eloXNwuQx30zm-wahGwDRseFlTKyglkSAAYgIaEl0bESUal0yn4d8HvE8T6dTMW7J6p4LY4zxxWfm1j36u3w9VyuXKoMdDv4K8PE22omjKGBrutZm-bgLPqfX1WoLMSruiv6LkyOnEAcGTiXbazv96qLincjg4J-_P0TdHzoeHn87miO0ZapjlGcVzrRcuOMKZ_VnpZzMLcTxOGtlwjHgUQz4Dhfw1bshhc_T4-LV1dfWDR4D-KvdwK6jTBdNBveT_pC0zRGIBJTSEMtLrlQiJbVaGJ4YkwL0SeI4tLFONAPHxATMT8ks1YppzmWoQsmYDKzLpp2gTjWvzCnCEkIWHerUJAaMypmksrQRtSpKlVVc9FDX2WK2WMtfzDZmOPvj_TXaG06eRrPRQ_54jvad6R15j_EL1GmWK3OJdtVH81Yvr_z0fQHC75vv
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%3Abook&rft.genre=proceeding&rft.title=SC24-W%3A+Workshops+of+the+International+Conference+for+High+Performance+Computing%2C+Networking%2C+Storage+and+Analysis&rft.atitle=An+Adaptive+Asynchronous+Approach+for+the+Single-Source+Shortest+Paths+Problem&rft.au=Rao%2C+Ritvik&rft.au=Chandrasekar%2C+Kavitha&rft.au=Kale%2C+Laxmikant&rft.date=2024-11-17&rft.pub=IEEE&rft.spage=697&rft.epage=702&rft_id=info:doi/10.1109%2FSCW63240.2024.00097&rft.externalDocID=10820768