{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T02:16:26Z","timestamp":1780107386807,"version":"3.54.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T00:00:00Z","timestamp":1582070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Oak Ridge National Laboratory"},{"DOI":"10.13039\/100000001","name":"National Science Foundation (NSF)","doi-asserted-by":"publisher","award":["1710371"],"award-info":[{"award-number":["1710371"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Defense Advanced Research Projects Agency (DARPA)","award":["FA8750-18-2-0108"],"award-info":[{"award-number":["FA8750-18-2-0108"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,2,19]]},"DOI":"10.1145\/3332466.3374533","type":"proceedings-article","created":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:13:53Z","timestamp":1582139633000},"page":"250-261","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["A supernodal all-pairs shortest path algorithm"],"prefix":"10.1145","author":[{"given":"Piyush","family":"Sao","sequence":"first","affiliation":[{"name":"Oak Ridge National Laboratory"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ramakrishnan","family":"Kannan","sequence":"additional","affiliation":[{"name":"Oak Ridge National Laboratory"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Prasun","family":"Gera","sequence":"additional","affiliation":[{"name":"Georgia Institute of technology"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard","family":"Vuduc","sequence":"additional","affiliation":[{"name":"Georgia Institute of technology"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,2,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90188-N"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/15.2.161"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/227234.227246"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2009.12.002"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/7.3.273"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109614"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2015.06.008"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198508380.001.0001"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579300005222"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216064"},{"key":"e_1_3_2_1_12_1","first-page":"45","volume-title":"Graph Algorithms in the Language of Linear Algebra","author":"Jeremy","year":"2011","unstructured":"Jeremy T. Fineman and Eric Robinson. Fundamental graph algorithms . In Jeremy Kepner and John Gilbert, editors, Graph Algorithms in the Language of Linear Algebra , chapter 5, pages 45 -- 58 . Society of Industrial and Applied Mathematics , Philadelphia, PA, USA , 2011 . Jeremy T. Fineman and Eric Robinson. Fundamental graph algorithms. In Jeremy Kepner and John Gilbert, editors, Graph Algorithms in the Language of Linear Algebra, chapter 5, pages 45--58. Society of Industrial and Applied Mathematics, Philadelphia, PA, USA, 2011."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0710032"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0710032"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.44"},{"key":"e_1_3_2_1_16_1","volume-title":"dioids and semirings: new models and algorithms","author":"Gondran Michel","year":"2008","unstructured":"Michel Gondran and Michel Minoux . Graphs , dioids and semirings: new models and algorithms , volume 41 . Springer Science & Business Media , 2008 . Michel Gondran and Michel Minoux. Graphs, dioids and semirings: new models and algorithms, volume 41. Springer Science & Business Media, 2008."},{"key":"e_1_3_2_1_17_1","volume-title":"Anatomy of high-performance matrix multiplication. ACM Transactions on Mathematical Software (TOMS), 34(3):12","author":"Goto Kazushige","year":"2008","unstructured":"Kazushige Goto and Robert A Geijn . Anatomy of high-performance matrix multiplication. ACM Transactions on Mathematical Software (TOMS), 34(3):12 , 2008 . Kazushige Goto and Robert A Geijn. Anatomy of high-performance matrix multiplication. ACM Transactions on Mathematical Software (TOMS), 34(3):12, 2008."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.598277"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1033099"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-06-01126-8"},{"key":"e_1_3_2_1_21_1","volume-title":"Efficient algorithms for shortest paths in sparse networks. Journal of the ACM (JACM), 24(1):1--13, 1","author":"Johnson Donald B.","year":"1977","unstructured":"Donald B. Johnson . Efficient algorithms for shortest paths in sparse networks. Journal of the ACM (JACM), 24(1):1--13, 1 1977 . Donald B. Johnson. Efficient algorithms for shortest paths in sparse networks. Journal of the ACM (JACM), 24(1):1--13, 1 1977."},{"key":"e_1_3_2_1_22_1","series-title":"SIAM Journal on Scientific Computing (SISC), 20(1)","volume-title":"A fast and high-quality multilevel scheme for partitioning irregular graphs","author":"Karypis George","year":"1998","unstructured":"George Karypis and Vipin Kumar . A fast and high-quality multilevel scheme for partitioning irregular graphs . SIAM Journal on Scientific Computing (SISC), 20(1) , 1998 . George Karypis and Vipin Kumar. A fast and high-quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing (SISC), 20(1), 1998."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2013.26"},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. Symposium on Application Accelerators in High Performance Computing (SAAHPC), Urbana-Champaign, IL, NCSA","author":"Krawezik G.","year":"2009","unstructured":"G. Krawezik and G. Poole . Accelerating the ANSYS direct sparse solver with GPUs . In Proc. Symposium on Application Accelerators in High Performance Computing (SAAHPC), Urbana-Champaign, IL, NCSA , 2009 . G. Krawezik and G. Poole. Accelerating the ANSYS direct sparse solver with GPUs. In Proc. Symposium on Application Accelerators in High Performance Computing (SAAHPC), Urbana-Champaign, IL, NCSA, 2009."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2014.9"},{"key":"e_1_3_2_1_26_1","series-title":"SIAM journal on numerical analysis, 16(2):346--358","volume-title":"Generalized nested dissection","author":"Lipton Richard J","year":"1979","unstructured":"Richard J Lipton , Donald J Rose , and Robert Endre Tarjan . Generalized nested dissection . SIAM journal on numerical analysis, 16(2):346--358 , 1979 . Richard J Lipton, Donald J Rose, and Robert Endre Tarjan. Generalized nested dissection. SIAM journal on numerical analysis, 16(2):346--358, 1979."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0136016"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36433-4_4"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1964238.1964249"},{"key":"e_1_3_2_1_30_1","first-page":"393","volume-title":"European symposium on algorithms","author":"Meyer Ulrich","year":"1998","unstructured":"Ulrich Meyer and Peter Sanders . \u0394-stepping : A parallel single source shortest path algorithm . In European symposium on algorithms , pages 393 -- 404 . Springer , 1998 . Ulrich Meyer and Peter Sanders. \u0394-stepping: A parallel single source shortest path algorithm. In European symposium on algorithms, pages 393--404. Springer, 1998."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61142-8_588"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567634.2567648"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/2387915.2387925"},{"key":"e_1_3_2_1_34_1","volume-title":"Exploiting the memory hierarchy in sequential and parallel sparse Cholesky factorization. Technical report","author":"Rothberg Edward","year":"1992","unstructured":"Edward Rothberg . Exploiting the memory hierarchy in sequential and parallel sparse Cholesky factorization. Technical report , Stanford University , Department of Computer Science, 1992 . Edward Rothberg. Exploiting the memory hierarchy in sequential and parallel sparse Cholesky factorization. Technical report, Stanford University, Department of Computer Science, 1992."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00100"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09873-9_41"},{"key":"e_1_3_2_1_37_1","volume-title":"The boost graph library: user guide and reference manual","author":"Siek Jeremy","year":"2002","unstructured":"Jeremy Siek , Andrew Lumsdaine , and Lie-Quan Lee . The boost graph library: user guide and reference manual . Addison-Wesley , 2002 . Jeremy Siek, Andrew Lumsdaine, and Lie-Quan Lee. The boost graph library: user guide and reference manual. Addison-Wesley, 2002."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA580350"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1996.548468"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48224-5_15"},{"key":"e_1_3_2_1_41_1","volume-title":"Proc. of the 2nd USENIX conference on Hot topics in parallelism, HotPar'10","author":"Vuduc R.","year":"2010","unstructured":"R. Vuduc , A. Chandramowlishwaran , J. Choi , M. Guney , and A. Shringarpure . On the limits of GPU acceleration . In Proc. of the 2nd USENIX conference on Hot topics in parallelism, HotPar'10 , Berkeley, CA , 2010 . R. Vuduc, A. Chandramowlishwaran, J. Choi, M. Guney, and A. Shringarpure. On the limits of GPU acceleration. In Proc. of the 2nd USENIX conference on Hot topics in parallelism, HotPar'10, Berkeley, CA, 2010."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/090767868"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1024524"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.67"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.63"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2011.09.002"}],"event":{"name":"PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"San Diego California","acronym":"PPoPP '20","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"]},"container-title":["Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3332466.3374533","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3332466.3374533","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3332466.3374533","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:38Z","timestamp":1750204478000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3332466.3374533"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,19]]},"references-count":45,"alternative-id":["10.1145\/3332466.3374533","10.1145\/3332466"],"URL":"https:\/\/doi.org\/10.1145\/3332466.3374533","relation":{},"subject":[],"published":{"date-parts":[[2020,2,19]]},"assertion":[{"value":"2020-02-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}