{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T12:32:34Z","timestamp":1773318754964,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":68,"publisher":"ACM","funder":[{"DOI":"10.13039\/100018694","name":"HORIZON EUROPE Marie Sklodowska-Curie Actions","doi-asserted-by":"publisher","award":["101072456"],"award-info":[{"award-number":["101072456"]}],"id":[{"id":"10.13039\/100018694","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014013","name":"UK Research and Innovation","doi-asserted-by":"publisher","award":["EP\/X029174\/1"],"award-info":[{"award-number":["EP\/X029174\/1"]}],"id":[{"id":"10.13039\/100014013","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,16]]},"DOI":"10.1145\/3712285.3759872","type":"proceedings-article","created":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T16:04:47Z","timestamp":1762963487000},"page":"2109-2125","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Wasp: Efficient Asynchronous Single-Source Shortest Path on Multicore Systems via Work Stealing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7399-7705","authenticated-orcid":false,"given":"Marco","family":"D'Antonio","sequence":"first","affiliation":[{"name":"Queen's University Belfast, Belfast, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4599-1525","authenticated-orcid":false,"given":"Thai Son","family":"Mai","sequence":"additional","affiliation":[{"name":"Queen's University Belfast, Belfast, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9635-9154","authenticated-orcid":false,"given":"Philippas","family":"Tsigas","sequence":"additional","affiliation":[{"name":"Chalmers University of Technology\\\\University of Gothenburg, Gothenburg, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5868-9259","authenticated-orcid":false,"given":"Hans","family":"Vandierendonck","sequence":"additional","affiliation":[{"name":"Queen's University Belfast, Belfast, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2025,11,15]]},"reference":[{"key":"e_1_3_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688523"},{"key":"e_1_3_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC50251.2020.00029"},{"key":"e_1_3_3_3_4_2","series-title":"Contemporary Mathematics","volume-title":"Graph Partitioning and Graph Clustering. 10th DIMACS Implementation Challenge Workshop","author":"Bader David\u00a0A","year":"2012","unstructured":"David\u00a0A Bader, Henning Meyerhenke, Peter Sanders, and Dorothea Wagner. 2012-02-13\/2012-02-14. Graph Partitioning and Graph Clustering. 10th DIMACS Implementation Challenge Workshop. Contemporary Mathematics, Vol.\u00a0588. American Mathematical Society and Center for Discrete Mathematics and Theoretical Computer Science. https:\/\/sites.cc.gatech.edu\/dimacs10"},{"key":"e_1_3_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2012.50"},{"key":"e_1_3_3_3_6_2","doi-asserted-by":"publisher","unstructured":"Scott Beamer Krste Asanovi\u0107 and David Patterson. 2017. The GAP Benchmark Suite. 10.48550\/arXiv.1508.03619 arxiv:https:\/\/arXiv.org\/abs\/1508.03619\u00a0[cs]","DOI":"10.48550\/arXiv.1508.03619"},{"key":"e_1_3_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400254"},{"key":"e_1_3_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935765"},{"key":"e_1_3_3_3_9_2","doi-asserted-by":"publisher","unstructured":"Robert\u00a0D. Blumofe Christopher\u00a0F. Joerg Bradley\u00a0C. Kuszmaul Charles\u00a0E. Leiserson Keith\u00a0H. Randall and Yuli Zhou. 1995. Cilk: An Efficient Multithreaded Runtime System. ACM SIGPLAN Notices 30 8 (Aug. 1995) 207\u2013216. 10.1145\/209937.209958","DOI":"10.1145\/209937.209958"},{"key":"e_1_3_3_3_10_2","doi-asserted-by":"publisher","unstructured":"Robert\u00a0D. Blumofe and Charles\u00a0E. Leiserson. 1999. Scheduling Multithreaded Computations by Work Stealing. J. ACM 46 5 (Sept. 1999) 720\u2013748. 10.1145\/324133.324234","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_3_3_11_2","doi-asserted-by":"publisher","unstructured":"Paolo Boldi Bruno Codenotti Massimo Santini and Sebastiano Vigna. 2004. UbiCrawler: A Scalable Fully Distributed Web Crawler. Software: Practice and Experience 34 8 (2004) 711\u2013726. 10.1002\/spe.587","DOI":"10.1002\/spe.587"},{"key":"e_1_3_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"e_1_3_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_3_3_14_2","doi-asserted-by":"publisher","unstructured":"Ulrik Brandes. 2001. A Faster Algorithm for Betweenness Centrality*. The Journal of Mathematical Sociology 25 2 (June 2001) 163\u2013177. 10.1080\/0022250X.2001.9990249","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.5555\/313852.313883"},{"key":"e_1_3_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2017.117"},{"key":"e_1_3_3_3_17_2","doi-asserted-by":"publisher","unstructured":"Venkatesan\u00a0T. 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 (July 2017) 2031\u20132045. 10.1109\/TPDS.2016.2634535","DOI":"10.1109\/TPDS.2016.2634535"},{"key":"e_1_3_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1073974"},{"key":"e_1_3_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.52"},{"key":"e_1_3_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC41404.2022.00055"},{"key":"e_1_3_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055823"},{"key":"e_1_3_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3711708.3723446"},{"key":"e_1_3_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2019.00010"},{"key":"e_1_3_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.45"},{"key":"e_1_3_3_3_25_2","doi-asserted-by":"publisher","unstructured":"Timothy\u00a0A. Davis. 2019. Algorithm 1000: SuiteSparse:GraphBLAS: Graph Algorithms in the Language of Sparse Linear Algebra. ACM Trans. Math. Softw. 45 4 (Dec. 2019) 44:1\u201344:25. 10.1145\/3322125","DOI":"10.1145\/3322125"},{"key":"e_1_3_3_3_26_2","doi-asserted-by":"publisher","unstructured":"Timothy\u00a0A. Davis. 2023. Algorithm\u00a01037: SuiteSparse:GraphBLAS: Parallel Graph Algorithms in the Language of Sparse Linear Algebra. ACM Trans. Math. Softw. 49 3 (Sept. 2023) 28:1\u201328:30. 10.1145\/3577195","DOI":"10.1145\/3577195"},{"key":"e_1_3_3_3_27_2","doi-asserted-by":"publisher","unstructured":"Timothy\u00a0A. Davis and Yifan Hu. 2011. The University of Florida Sparse Matrix Collection. ACM Trans. Math. Software 38 1 (Dec. 2011) 1:1\u20131:25. 10.1145\/2049662.2049663","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/074"},{"key":"e_1_3_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087580"},{"key":"e_1_3_3_3_30_2","doi-asserted-by":"publisher","unstructured":"Laxman Dhulipala Guy\u00a0E. Blelloch and Julian Shun. 2021. Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. ACM Transactions on Parallel Computing 8 1 (April 2021) 4:1\u20134:70. 10.1145\/3434393","DOI":"10.1145\/3434393"},{"key":"e_1_3_3_3_31_2","doi-asserted-by":"publisher","unstructured":"E.\u00a0W. Dijkstra. 1959. A Note on Two Problems in Connexion with Graphs. Numer. Math. 1 1 (Dec. 1959) 269\u2013271. 10.1007\/BF01386390","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461782"},{"key":"e_1_3_3_3_33_2","unstructured":"Paul Erd\u0151s and Alfr\u00e9d R\u00e9nyi. 1960. On the Evolution of Random Graphs. Publ. math. inst. hung. acad. sci 5 1 (1960) 17\u201360."},{"key":"e_1_3_3_3_34_2","doi-asserted-by":"publisher","unstructured":"R. Guimer\u00e0 S. Mossa A. Turtschi and L.\u00a0A.\u00a0N. Amaral. 2005. The Worldwide Air Transportation Network: Anomalous Centrality Community Structure and Cities\u2019 Global Roles. Proceedings of the National Academy of Sciences 102 22 (May 2005) 7794\u20137799. 10.1073\/pnas.0407994102","DOI":"10.1073\/pnas.0407994102"},{"key":"e_1_3_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/2628071.2628091"},{"key":"e_1_3_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2009.9"},{"key":"e_1_3_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2016.7761646"},{"key":"e_1_3_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48096-017"},{"key":"e_1_3_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/1156412617"},{"key":"e_1_3_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00025"},{"key":"e_1_3_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00059"},{"key":"e_1_3_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/2925426.2926287"},{"key":"e_1_3_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00022"},{"key":"e_1_3_3_3_46_2","doi-asserted-by":"publisher","unstructured":"U. Meyer and P. Sanders. 2003. \u0394 -Stepping: A Parallelizable Shortest Path Algorithm. Journal of Algorithms 49 1 (Oct. 2003) 114\u2013152. 10.1016\/S0196-6774(03)00076-2","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_3_3_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2006.302741"},{"key":"e_1_3_3_3_48_2","unstructured":"Richard\u00a0C Murphy Kyle\u00a0B Wheeler Brian\u00a0W Barrett and James\u00a0A Ang. 2010. Introducing the Graph 500. Cray Users Group (CUG) 19 45-74 (2010) 22."},{"key":"e_1_3_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_3_3_50_2","doi-asserted-by":"publisher","unstructured":"Amir\u00a0Hossein Nodehi\u00a0Sabet Junqiao Qiu and Zhijia Zhao. 2018. Tigr: Transforming Irregular Graphs for GPU-Friendly Graph Processing. ACM SIGPLAN Notices 53 2 (March 2018) 622\u2013636. 10.1145\/3296957.3173180","DOI":"10.1145\/3296957.3173180"},{"key":"e_1_3_3_3_51_2","doi-asserted-by":"publisher","unstructured":"James\u00a0B. Orlin Kamesh Madduri K. Subramani and M. Williamson. 2010. A Faster Algorithm for the Single Source Shortest Path Problem with Few Distinct Positive Lengths. Journal of Discrete Algorithms 8 2 (June 2010) 189\u2013198. 10.1016\/j.jda.2009.03.001","DOI":"10.1016\/j.jda.2009.03.001"},{"key":"e_1_3_3_3_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993501"},{"key":"e_1_3_3_3_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3503221.3508432"},{"key":"e_1_3_3_3_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755616"},{"key":"e_1_3_3_3_55_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2019.00047"},{"key":"e_1_3_3_3_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/3079079.3079097"},{"key":"e_1_3_3_3_57_2","doi-asserted-by":"publisher","unstructured":"Robert\u00a0E. Tarjan and Uzi Vishkin. 1985. An Efficient Parallel Biconnectivity Algorithm. SIAM J. Comput. 14 4 (Nov. 1985) 862\u2013874. 10.1137\/0214061","DOI":"10.1137\/0214061"},{"key":"e_1_3_3_3_58_2","doi-asserted-by":"publisher","unstructured":"Leslie\u00a0G. Valiant. 1990. A Bridging Model for Parallel Computation. Commun. ACM 33 8 (Aug. 1990) 103\u2013111. 10.1145\/79173.79181","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_3_3_59_2","doi-asserted-by":"publisher","DOI":"10.1145\/3392717.3392753"},{"key":"e_1_3_3_3_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295733"},{"key":"e_1_3_3_3_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/3437801.3441605"},{"key":"e_1_3_3_3_62_2","doi-asserted-by":"publisher","unstructured":"Letong Wang Xiaojun Dong Yan Gu and Yihan Sun. 2023. Parallel Strong Connectivity Based on Faster Reachability. Proc. ACM Manag. Data 1 2 (June 2023) 114:1\u2013114:29. 10.1145\/3589259","DOI":"10.1145\/3589259"},{"key":"e_1_3_3_3_63_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2021.81"},{"key":"e_1_3_3_3_64_2","doi-asserted-by":"publisher","unstructured":"Martin Wimmer Jakob Gruber Jesper\u00a0Larsson Tr\u00e4ff and Philippas Tsigas. 2015. The Lock-Free k-LSM Relaxed Priority Queue. ACM SIGPLAN Notices 50 8 (Jan. 2015) 277\u2013278. 10.1145\/2858788.2688547","DOI":"10.1145\/2858788.2688547"},{"key":"e_1_3_3_3_65_2","doi-asserted-by":"publisher","DOI":"10.1145\/2350190.2350193"},{"key":"e_1_3_3_3_66_2","doi-asserted-by":"publisher","unstructured":"F.\u00a0Benjamin Zhan and Charles\u00a0E. Noon. 1998. Shortest Path Algorithms: An Evaluation Using Real Road Networks. Transportation Science 32 1 (Feb. 1998) 65\u201373. 10.1287\/trsc.32.1.65","DOI":"10.1287\/trsc.32.1.65"},{"key":"e_1_3_3_3_67_2","doi-asserted-by":"publisher","DOI":"10.1145\/3626183.3659962"},{"key":"e_1_3_3_3_68_2","doi-asserted-by":"publisher","DOI":"10.1145\/3368826.3377909"},{"key":"e_1_3_3_3_69_2","doi-asserted-by":"publisher","DOI":"10.1145\/3605731.3605746"}],"event":{"name":"SC '25: The International Conference for High Performance Computing, Networking, Storage and Analysis","location":"St. Louis MO USA","acronym":"SC '25","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"]},"container-title":["Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712285.3759872","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T18:50:36Z","timestamp":1773255036000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712285.3759872"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,15]]},"references-count":68,"alternative-id":["10.1145\/3712285.3759872","10.1145\/3712285"],"URL":"https:\/\/doi.org\/10.1145\/3712285.3759872","relation":{},"subject":[],"published":{"date-parts":[[2025,11,15]]},"assertion":[{"value":"2025-11-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}