{"id":"https://openalex.org/W4406157779","doi":"https://doi.org/10.1109/scw63240.2024.00097","title":"An Adaptive Asynchronous Approach for the Single-Source Shortest Paths Problem","display_name":"An Adaptive Asynchronous Approach for the Single-Source Shortest Paths Problem","publication_year":2024,"publication_date":"2024-11-17","ids":{"openalex":"https://openalex.org/W4406157779","doi":"https://doi.org/10.1109/scw63240.2024.00097"},"language":"en","primary_location":{"id":"doi:10.1109/scw63240.2024.00097","is_oa":false,"landing_page_url":"https://doi.org/10.1109/scw63240.2024.00097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ritvik Rao","orcid":null},"institutions":[{"id":"https://openalex.org/I2801919071","display_name":"University of Illinois System","ror":"https://ror.org/05e94g991","country_code":"US","type":"education","lineage":["https://openalex.org/I2801919071"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ritvik Rao","raw_affiliation_strings":["University of Illinois,Urbana,IL,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois,Urbana,IL,USA","institution_ids":["https://openalex.org/I2801919071"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023790877","display_name":"Kavitha Chandrasekar","orcid":"https://orcid.org/0000-0003-4826-4286"},"institutions":[{"id":"https://openalex.org/I2801919071","display_name":"University of Illinois System","ror":"https://ror.org/05e94g991","country_code":"US","type":"education","lineage":["https://openalex.org/I2801919071"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kavitha Chandrasekar","raw_affiliation_strings":["University of Illinois,Urbana,IL,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois,Urbana,IL,USA","institution_ids":["https://openalex.org/I2801919071"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051465480","display_name":"Laxmikant V. Kal\u00e9","orcid":"https://orcid.org/0000-0001-9673-8445"},"institutions":[{"id":"https://openalex.org/I2801919071","display_name":"University of Illinois System","ror":"https://ror.org/05e94g991","country_code":"US","type":"education","lineage":["https://openalex.org/I2801919071"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Laxmikant Kale","raw_affiliation_strings":["University of Illinois,Urbana,IL,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois,Urbana,IL,USA","institution_ids":["https://openalex.org/I2801919071"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I2801919071"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.26582908,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"697","last_page":"702"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9776999950408936,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9776999950408936,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9746000170707703,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9427000284194946,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7189853191375732},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7062349319458008},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.49855542182922363},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2544472813606262},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.25184983015060425},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06963273882865906}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7189853191375732},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7062349319458008},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.49855542182922363},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2544472813606262},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.25184983015060425},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06963273882865906}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/scw63240.2024.00097","is_oa":false,"landing_page_url":"https://doi.org/10.1109/scw63240.2024.00097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W109781734","https://openalex.org/W1482680420","https://openalex.org/W1974154846","https://openalex.org/W2057112598","https://openalex.org/W2079577430","https://openalex.org/W2227557434","https://openalex.org/W2339875341","https://openalex.org/W2558631043","https://openalex.org/W4220754604","https://openalex.org/W4401247587","https://openalex.org/W6874649916","https://openalex.org/W6903806663"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2116677773","https://openalex.org/W2155261584","https://openalex.org/W2584231425","https://openalex.org/W2150611273","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W4207086172"],"abstract_inverted_index":{"Large-scale":[0],"graphs":[1],"with":[2,121],"billions":[3],"and":[4,8,70,76,80,92,94],"trillions":[5],"of":[6,19,39,97,118,129],"vertices":[7],"edges":[9],"require":[10],"efficient":[11],"parallel":[12,27],"algorithms":[13,28],"for":[14,47],"common":[15],"graph":[16,130],"problems,":[17],"one":[18],"which":[20],"is":[21],"single-source":[22],"shortest":[23],"paths":[24],"(SSSP).":[25],"Bulk-synchronous":[26],"such":[29,88],"as":[30,89],"\u2206-stepping":[31],"experience":[32],"large":[33],"synchronization":[34],"costs":[35],"at":[36,104],"the":[37,116,122],"scale":[38],"many":[40],"nodes,":[41],"so":[42],"asynchronous":[43,50,63],"approaches":[44,51],"are":[45,52],"needed":[46],"scalability.":[48],"However,":[49],"susceptible":[53],"to":[54,124],"wasteful,":[55],"speculative":[56,106],"execution.":[57],"We":[58],"introduce":[59],"ACIC,":[60],"a":[61,126],"highly":[62],"approach":[64],"modulated":[65],"by":[66],"continuous":[67],"concurrent":[68,74],"introspection":[69],"adaptation.":[71],"Using":[72],"message-driven":[73],"reductions":[75],"broadcasts,":[77],"task-based":[78],"scheduling,":[79],"an":[81],"adaptive":[82],"aggregation":[83],"library,":[84],"we":[85],"explore":[86],"techniques":[87],"evolving":[90],"windows":[91],"generation":[93],"prioritized":[95],"flow":[96],"optimal":[98],"updates,":[99],"or":[100],"edge":[101],"relaxations,":[102],"aimed":[103],"reducing":[105],"loss":[107],"without":[108],"constraining":[109],"parallelism.":[110],"Our":[111],"results,":[112],"while":[113],"preliminary,":[114],"demonstrate":[115],"promise":[117],"these":[119],"ideas,":[120],"potential":[123],"impact":[125],"wider":[127],"class":[128],"algorithms.":[131]},"counts_by_year":[],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-10T00:00:00"}