{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:20Z","timestamp":1750220360145,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T00:00:00Z","timestamp":1628467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972447"],"award-info":[{"award-number":["61972447"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,9]]},"DOI":"10.1145\/3472456.3472524","type":"proceedings-article","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T18:39:57Z","timestamp":1633459197000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Communication Avoiding All-Pairs Shortest Paths Algorithm for Sparse Graphs"],"prefix":"10.1145","author":[{"given":"Lin","family":"Zhu","sequence":"first","affiliation":[{"name":"Huazhong University of Science and Technology, China"}]},{"given":"Qiang-Sheng","family":"Hua","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, China"}]},{"given":"Hai","family":"Jin","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, China"}]}],"member":"320","published-online":{"date-parts":[[2021,10,5]]},"reference":[{"volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho V.","key":"e_1_3_2_1_1_1","unstructured":"Alfred\u00a0 V. Aho , John\u00a0 E. Hopcroft , and Jeffrey\u00a0 D. Ullman . 1974. The Design and Analysis of Computer Algorithms . Addison-Wesley . Alfred\u00a0V. Aho, John\u00a0E. Hopcroft, and Jeffrey\u00a0D. Ullman. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley."},{"volume-title":"Guide","author":"Anderson Ed","key":"e_1_3_2_1_2_1","unstructured":"Ed Anderson , Zhaojun Bai , Christian\u00a0 H. Bischof , L.\u00a0 Susan Blackford , James Demmel , Jack\u00a0 J. Dongarra , Jeremy\u00a0Du Croz , Anne Greenbaum , Sven Hammarling , A. McKenney , and Danny\u00a0 C. Sorensen . 1999. LAPACK Users \u2019 Guide , Third Edition. SIAM. Ed Anderson, Zhaojun Bai, Christian\u00a0H. Bischof, L.\u00a0Susan Blackford, James Demmel, Jack\u00a0J. Dongarra, Jeremy\u00a0Du Croz, Anne Greenbaum, Sven Hammarling, A. McKenney, and Danny\u00a0C. Sorensen. 1999. LAPACK Users\u2019 Guide, Third Edition. SIAM."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Grey Ballard Aydin Bulu\u00e7 James Demmel Laura Grigori Benjamin Lipshitz Oded Schwartz and Sivan Toledo. 2013. Communication optimal parallel multiplication of sparse random matrices. In SPAA \u201913.  Grey Ballard Aydin Bulu\u00e7 James Demmel Laura Grigori Benjamin Lipshitz Oded Schwartz and Sivan Toledo. 2013. Communication optimal parallel multiplication of sparse random matrices. In SPAA \u201913.","DOI":"10.21236\/ADA580140"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492914000038"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Grey Ballard James Demmel Olga Holtz Benjamin Lipshitz and Oded Schwartz. 2012. Communication-optimal parallel algorithm for strassen\u2019s matrix multiplication. In SPAA \u201912.  Grey Ballard James Demmel Olga Holtz Benjamin Lipshitz and Oded Schwartz. 2012. Communication-optimal parallel algorithm for strassen\u2019s matrix multiplication. In SPAA \u201912.","DOI":"10.1145\/2312005.2312044"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/090769156"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3015144"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/7.3.273"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"James Demmel David Eliahu Armando Fox Shoaib Kamil Benjamin Lipshitz Oded Schwartz and Omer Spillinger. 2013. Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication. In IPDPS \u201913.  James Demmel David Eliahu Armando Fox Shoaib Kamil Benjamin Lipshitz Oded Schwartz and Omer Spillinger. 2013. Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication. In IPDPS \u201913.","DOI":"10.1109\/IPDPS.2013.80"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0710032"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.598277"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.03.021"},{"key":"e_1_3_2_1_14_1","unstructured":"Jing-Fu Jenq and Sartaj Sahni. 1987. All Pairs Shortest Paths on a Hypercube Multiprocessor. In ICPP \u201987.  Jing-Fu Jenq and Sartaj Sahni. 1987. All Pairs Shortest Paths on a Hypercube Multiprocessor. In ICPP \u201987."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Hong Jia-Wei and Hsiang-Tsung Kung. 1981. I\/O complexity: The red-blue pebble game. In STOC \u201981.  Hong Jia-Wei and Hsiang-Tsung Kung. 1981. I\/O complexity: The red-blue pebble game. In STOC \u201981.","DOI":"10.1145\/800076.802486"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1403"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/779359.779361"},{"key":"e_1_3_2_1_20_1","series-title":"SIAM journal on numerical analysis 16, 2","volume-title":"Generalized nested dissection","author":"Lipton J","year":"1979","unstructured":"Richard\u00a0 J Lipton , Donald\u00a0 J Rose , and Robert\u00a0Endre Tarjan . 1979. Generalized nested dissection . SIAM journal on numerical analysis 16, 2 ( 1979 ), 346\u2013358. Richard\u00a0J Lipton, Donald\u00a0J Rose, and Robert\u00a0Endre Tarjan. 1979. Generalized nested dissection. SIAM journal on numerical analysis 16, 2 (1979), 346\u2013358."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.44"},{"key":"e_1_3_2_1_22_1","unstructured":"Piyush Sao Ramakrishnan Kannan Prasun Gera and Richard\u00a0W. Vuduc. 2020. A supernodal all-pairs shortest path algorithm. In PPoPP \u201920.  Piyush Sao Ramakrishnan Kannan Prasun Gera and Richard\u00a0W. Vuduc. 2020. A supernodal all-pairs shortest path algorithm. In PPoPP \u201920."},{"key":"e_1_3_2_1_23_1","unstructured":"Piyush Sao Xiaoye\u00a0Sherry Li and Richard\u00a0W. Vuduc. 2018. A Communication-Avoiding 3D LU Factorization Algorithm for Sparse Matrices. In IPDPS \u201918.  Piyush Sao Xiaoye\u00a0Sherry Li and Richard\u00a0W. Vuduc. 2018. A Communication-Avoiding 3D LU Factorization Algorithm for Sparse Matrices. In IPDPS \u201918."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Edgar Solomonik Aydin Bulu\u00e7 and James Demmel. 2013. Minimizing Communication in All-Pairs Shortest Paths. In IPDPS \u201913.  Edgar Solomonik Aydin Bulu\u00e7 and James Demmel. 2013. Minimizing Communication in All-Pairs Shortest Paths. In IPDPS \u201913.","DOI":"10.1109\/IPDPS.2013.111"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321107"},{"key":"e_1_3_2_1_26_1","unstructured":"Cui-Qing Yang and Barton\u00a0P. Miller. 1988. Critical Path Analysis for the Execution of Parallel and Distributed Programs. In ICDCS \u201988.  Cui-Qing Yang and Barton\u00a0P. Miller. 1988. Critical Path Analysis for the Execution of Parallel and Distributed Programs. In ICDCS \u201988."}],"event":{"name":"ICPP 2021: 50th International Conference on Parallel Processing","acronym":"ICPP 2021","location":"Lemont IL USA"},"container-title":["50th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472456.3472524","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3472456.3472524","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:23Z","timestamp":1750191443000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472456.3472524"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,9]]},"references-count":26,"alternative-id":["10.1145\/3472456.3472524","10.1145\/3472456"],"URL":"https:\/\/doi.org\/10.1145\/3472456.3472524","relation":{},"subject":[],"published":{"date-parts":[[2021,8,9]]},"assertion":[{"value":"2021-10-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}