{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:40:30Z","timestamp":1768030830733,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T00:00:00Z","timestamp":1717027200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,5,30]]},"DOI":"10.1145\/3650200.3656600","type":"proceedings-article","created":{"date-parts":[[2024,6,3]],"date-time":"2024-06-03T14:11:54Z","timestamp":1717423914000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["DAWN: Matrix Operation-Optimized Algorithm for Shortest Paths Problem on Unweighted Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3134-9227","authenticated-orcid":false,"given":"Yelai","family":"Feng","sequence":"first","affiliation":[{"name":"College of Electronic Engineering, National University of Defense Technology, China and College of Computer Science and Technology, National University of Defense Technology, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6277-850X","authenticated-orcid":false,"given":"Huaixi","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Electronic Engineering, National University of Defense Technology, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-8258-8275","authenticated-orcid":false,"given":"Yining","family":"Zhu","sequence":"additional","affiliation":[{"name":"Ningbo Institute of Technology, Zhejiang University, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-5693-014X","authenticated-orcid":false,"given":"Xiandong","family":"Liu","sequence":"additional","affiliation":[{"name":"PerfXLab(Beijing) Technologies Co.,Ltd, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-1285-6324","authenticated-orcid":false,"given":"Hongyi","family":"Lu","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, National University of Defense Technology, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-9688-0100","authenticated-orcid":false,"given":"Qing","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Electrical and Computer Engineering, Technical University of Munich, Germany"}]}],"member":"320","published-online":{"date-parts":[[2024,6,3]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Diameter of the world-wide web. nature 401, 6749","author":"Albert R\u00e9ka","year":"1999","unstructured":"R\u00e9ka Albert, Hawoong Jeong, and Albert-L\u00e1szl\u00f3 Barab\u00e1si. 1999. Diameter of the world-wide web. nature 401, 6749 (1999), 130\u2013131."},{"key":"e_1_3_2_1_2_1","volume-title":"Doklady Akademii Nauk, Vol.\u00a0194","author":"Arlazarov Vladimir\u00a0L\u2019vovich","unstructured":"Vladimir\u00a0L\u2019vovich Arlazarov, Yefim\u00a0A Dinitz, MA Kronrod, and IgorAleksandrovich Faradzhev. 1970. On economical construction of the transitive closure of an oriented graph. In Doklady Akademii Nauk, Vol.\u00a0194. Russian Academy of Sciences, 487\u2013488."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2012.50"},{"key":"e_1_3_2_1_4_1","volume-title":"The GAP benchmark suite. arXiv preprint arXiv:1508.03619","author":"Beamer Scott","year":"2015","unstructured":"Scott Beamer, Krste Asanovi\u0107, and David Patterson. 2015. The GAP benchmark suite. arXiv preprint arXiv:1508.03619 (2015)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2013.159"},{"key":"e_1_3_2_1_6_1","volume-title":"Network optimization: continuous and discrete models. 8, 2","author":"Bertsekas Dimitri","year":"1998","unstructured":"Dimitri Bertsekas. 1998. Network optimization: continuous and discrete models. 8, 2 (1998), 91\u2013112."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2841997.2842006"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1981-0621971-7"},{"key":"e_1_3_2_1_9_1","volume-title":"Distributed-memory breadth-first search on massive graphs. arXiv preprint arXiv:1705.04590","author":"Bulu\u00e7 Aydin","year":"2017","unstructured":"Aydin Bulu\u00e7, Scott Beamer, Kamesh Madduri, Krste Asanovic, and David Patterson. 2017. Distributed-memory breadth-first search on massive graphs. arXiv preprint arXiv:1705.04590 (2017)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2485994"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2344422.2344424"},{"key":"e_1_3_2_1_12_1","unstructured":"Mo Chen Rezaul\u00a0Alam Chowdhury Vijaya Ramachandran David\u00a0Lan Roche and Lingling Tong. 2007. Priority queues and dijkstra\u2019s algorithm. (2007)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.90.058701"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28396"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.45"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087580"},{"key":"e_1_3_2_1_18_1","volume-title":"Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).","author":"Dhulipala Laxman","year":"2018","unstructured":"Laxman Dhulipala, Guy\u00a0E. Blelloch, and Julian Shun. 2018. Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)."},{"key":"e_1_3_2_1_19_1","volume-title":"A note on two problems in connexion with graphs. Numerische mathematik 1, 1","author":"W Dijkstra","year":"1959","unstructured":"Edsger\u00a0W Dijkstra 1959. A note on two problems in connexion with graphs. Numerische mathematik 1, 1 (1959), 269\u2013271."},{"key":"e_1_3_2_1_20_1","volume-title":"An appraisal of some shortest-path algorithms. Operations research 17, 3","author":"Dreyfus E","year":"1969","unstructured":"Stuart\u00a0E Dreyfus. 1969. An appraisal of some shortest-path algorithms. Operations research 17, 3 (1969), 395\u2013412."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.14.1.19"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2620"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1239\/aap\/1198177228"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/42411.42415"},{"key":"e_1_3_2_1_26_1","volume-title":"Structural models: An introduction to the theory of directed graphs. 5, 1","author":"Harary Frank","year":"1965","unstructured":"Frank Harary, Robert\u00a0Zane Norman, and Dorwin Cartwright. 1965. Structural models: An introduction to the theory of directed graphs. 5, 1 (1965), 111\u2013115."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_1_29_1","volume-title":"An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree.Computational Support for Discrete Mathematics 15","author":"Moret ME","year":"1992","unstructured":"Bernard\u00a0ME Moret and Henry\u00a0D Shapiro. 1992. An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree.Computational Support for Discrete Mathematics 15 (1992), 99\u2013117."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/792765.793437"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW55747.2022.00061"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3572848.3577434"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/261342.261352"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-004-0002-2"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374533"},{"key":"e_1_3_2_1_36_1","volume-title":"Proceedings of the 30th International Symposium on High-Performance Parallel and Distributed Computing","author":"Hao","year":"2021","unstructured":"piyush sao, Hao lu, Ramakrishnan Kannan, Vijay Thakkar, Richard Vuduc, and Thomas Potok. 2021. Scalable All-Pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters. In Proceedings of the 30th International Symposium on High-Performance Parallel and Distributed Computing (Virtual Event, Sweden) (HPDC \u201921). Association for Computing Machinery, New York, NY, USA, 121\u2013131."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1078"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374527"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2015.8"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994522"},{"key":"e_1_3_2_1_42_1","volume-title":"Gaussian elimination is not optimal. Numerische mathematik 13, 4","author":"Volker Strassen","year":"1969","unstructured":"Volker Strassen 1969. Gaussian elimination is not optimal. Numerische mathematik 13, 4 (1969), 354\u2013356."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICECA.2017.8212794"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009198"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063748"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/3485"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288246"},{"key":"e_1_3_2_1_48_1","volume-title":"Network Flows: Theory, Algorithms, and Applications.","author":"Waissi R","year":"1994","unstructured":"Gary\u00a0R Waissi. 1994. Network Flows: Theory, Algorithms, and Applications."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295733"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851145"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3108140"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"}],"event":{"name":"ICS '24: 2024 International Conference on Supercomputing","location":"Kyoto Japan","acronym":"ICS '24","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 38th ACM International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3650200.3656600","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3650200.3656600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T15:22:52Z","timestamp":1755876172000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3650200.3656600"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,30]]},"references-count":52,"alternative-id":["10.1145\/3650200.3656600","10.1145\/3650200"],"URL":"https:\/\/doi.org\/10.1145\/3650200.3656600","relation":{},"subject":[],"published":{"date-parts":[[2024,5,30]]},"assertion":[{"value":"2024-06-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}