{"id":"https://openalex.org/W4416203757","doi":"https://doi.org/10.1145/3712285.3759872","title":"Wasp: Efficient Asynchronous Single-Source Shortest Path on Multicore Systems via Work Stealing","display_name":"Wasp: Efficient Asynchronous Single-Source Shortest Path on Multicore Systems via Work Stealing","publication_year":2025,"publication_date":"2025-11-12","ids":{"openalex":"https://openalex.org/W4416203757","doi":"https://doi.org/10.1145/3712285.3759872"},"language":"en","primary_location":{"id":"doi:10.1145/3712285.3759872","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3712285.3759872","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 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":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3712285.3759872","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041323874","display_name":"Marco D\u2019Antonio","orcid":"https://orcid.org/0009-0002-7399-7705"},"institutions":[{"id":"https://openalex.org/I126231945","display_name":"Queen's University Belfast","ror":"https://ror.org/00hswnk62","country_code":"GB","type":"education","lineage":["https://openalex.org/I126231945"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Marco D'Antonio","raw_affiliation_strings":["Queen's University Belfast, Belfast, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Queen's University Belfast, Belfast, United Kingdom","institution_ids":["https://openalex.org/I126231945"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029957844","display_name":"Son T.","orcid":"https://orcid.org/0000-0003-4599-1525"},"institutions":[{"id":"https://openalex.org/I126231945","display_name":"Queen's University Belfast","ror":"https://ror.org/00hswnk62","country_code":"GB","type":"education","lineage":["https://openalex.org/I126231945"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Thai Son Mai","raw_affiliation_strings":["Queen's University Belfast, Belfast, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Queen's University Belfast, Belfast, United Kingdom","institution_ids":["https://openalex.org/I126231945"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003177344","display_name":"Philippas Tsigas","orcid":"https://orcid.org/0000-0001-9635-9154"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Philippas Tsigas","raw_affiliation_strings":["Chalmers University of Technology\\\\University of Gothenburg, Gothenburg, Sweden"],"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology\\\\University of Gothenburg, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086758775","display_name":"Hans Vandierendonck","orcid":"https://orcid.org/0000-0001-5868-9259"},"institutions":[{"id":"https://openalex.org/I126231945","display_name":"Queen's University Belfast","ror":"https://ror.org/00hswnk62","country_code":"GB","type":"education","lineage":["https://openalex.org/I126231945"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Hans Vandierendonck","raw_affiliation_strings":["Queen's University Belfast, Belfast, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Queen's University Belfast, Belfast, United Kingdom","institution_ids":["https://openalex.org/I126231945"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5041323874"],"corresponding_institution_ids":["https://openalex.org/I126231945"],"apc_list":null,"apc_paid":null,"fwci":2.4362,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.91160967,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2109","last_page":"2125"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.47609999775886536,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.47609999775886536,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.14990000426769257,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.08250000327825546,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7384999990463257},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6381999850273132},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4973999857902527},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.4864000082015991},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.47510001063346863},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.460999995470047},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.4546000063419342},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4472000002861023}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7515000104904175},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7384999990463257},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6381999850273132},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5317999720573425},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4973999857902527},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.4864000082015991},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.47510001063346863},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.46560001373291016},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.460999995470047},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.4546000063419342},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4472000002861023},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43479999899864197},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.42890000343322754},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.38960000872612},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36239999532699585},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.3549000024795532},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.34950000047683716},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.322299987077713},{"id":"https://openalex.org/C150495011","wikidata":"https://www.wikidata.org/wiki/Q128392","display_name":"Concurrent computing","level":2,"score":0.31119999289512634},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29330000281333923},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.27619999647140503},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2563000023365021}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3712285.3759872","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3712285.3759872","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.qub.ac.uk/portal:openaire/6597c578-57d3-4473-97b9-9f060f2de376","is_oa":true,"landing_page_url":"https://pure.qub.ac.uk/en/publications/6597c578-57d3-4473-97b9-9f060f2de376","pdf_url":null,"source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"D'Antonio, M, Mai, T S, Tsigas, P & Vandierendonck, H 2025, Wasp: efficient asynchronous single-source shortest path on multicore systems via work stealing. in SC '25: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. Association for Computing Machinery, pp. 2109-2125, SC '25: The International Conference for High Performance Computing, Networking, Storage and Analysis, St. Louis, United States, 16/11/2025. https://doi.org/10.1145/3712285.3759872","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"doi:10.1145/3712285.3759872","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3712285.3759872","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1606329981","display_name":null,"funder_award_id":"101072456","funder_id":"https://openalex.org/F4320338438","funder_display_name":"HORIZON EUROPE Marie Sklodowska-Curie Actions"},{"id":"https://openalex.org/G3389542234","display_name":null,"funder_award_id":"EP/X029174/1","funder_id":"https://openalex.org/F4320314731","funder_display_name":"UK Research and Innovation"}],"funders":[{"id":"https://openalex.org/F4320314731","display_name":"UK Research and Innovation","ror":"https://ror.org/001aqnf71"},{"id":"https://openalex.org/F4320338438","display_name":"HORIZON EUROPE Marie Sklodowska-Curie Actions","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":63,"referenced_works":["https://openalex.org/W131619556","https://openalex.org/W1521472129","https://openalex.org/W1974154846","https://openalex.org/W1992011279","https://openalex.org/W1994727615","https://openalex.org/W1995040285","https://openalex.org/W2000273502","https://openalex.org/W2016179297","https://openalex.org/W2016559894","https://openalex.org/W2034102265","https://openalex.org/W2035080386","https://openalex.org/W2045271686","https://openalex.org/W2054983537","https://openalex.org/W2057112598","https://openalex.org/W2061394399","https://openalex.org/W2068015060","https://openalex.org/W2082773934","https://openalex.org/W2095941092","https://openalex.org/W2100586428","https://openalex.org/W2101196063","https://openalex.org/W2107173440","https://openalex.org/W2130476447","https://openalex.org/W2132473764","https://openalex.org/W2155771955","https://openalex.org/W2169528473","https://openalex.org/W2171707538","https://openalex.org/W2269957429","https://openalex.org/W2409471617","https://openalex.org/W2461193710","https://openalex.org/W2535200800","https://openalex.org/W2558631043","https://openalex.org/W2609578772","https://openalex.org/W2619040869","https://openalex.org/W2732233446","https://openalex.org/W2739409954","https://openalex.org/W2912007486","https://openalex.org/W2950343219","https://openalex.org/W2966422549","https://openalex.org/W2986726791","https://openalex.org/W2995872593","https://openalex.org/W3008451639","https://openalex.org/W3038443554","https://openalex.org/W3041215255","https://openalex.org/W3107316479","https://openalex.org/W3130678148","https://openalex.org/W3161374268","https://openalex.org/W3173178143","https://openalex.org/W3198705423","https://openalex.org/W4205190765","https://openalex.org/W4220783457","https://openalex.org/W4232836277","https://openalex.org/W4235198076","https://openalex.org/W4235810972","https://openalex.org/W4253426709","https://openalex.org/W4317935401","https://openalex.org/W4321636597","https://openalex.org/W4376652697","https://openalex.org/W4385283853","https://openalex.org/W4385286790","https://openalex.org/W4386515876","https://openalex.org/W4394639551","https://openalex.org/W4399345956","https://openalex.org/W4410037157"],"related_works":[],"abstract_inverted_index":{"The":[0],"Single-Source":[1],"Shortest":[2],"Path":[3],"(SSSP)":[4],"problem":[5,10],"is":[6],"a":[7],"fundamental":[8],"graph":[9],"with":[11],"an":[12],"extensive":[13],"set":[14],"of":[15,44],"real-world":[16],"applications.":[17],"State-of-the-art":[18],"parallel":[19,48],"algorithms":[20],"for":[21],"SSSP,":[22],"such":[23],"as":[24],"the":[25,42],"\u0394":[26],"-stepping":[27],"algorithm,":[28],"create":[29],"parallelism":[30],"through":[31],"priority":[32],"coarsening.":[33],"Priority":[34],"coarsening":[35],"results":[36],"in":[37],"redundant":[38],"computations":[39],"that":[40],"diminish":[41],"benefits":[43],"parallelization":[45],"and":[46],"limit":[47],"scalability.":[49]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-11-12T00:00:00"}