{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T16:52:40Z","timestamp":1758473560245,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T00:00:00Z","timestamp":1611100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF1510222"],"award-info":[{"award-number":["W911NF1510222"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1704715"],"award-info":[{"award-number":["CCF-1704715"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,1,20]]},"DOI":"10.1145\/3432261.3432271","type":"proceedings-article","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T03:24:09Z","timestamp":1610594649000},"page":"110-119","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["A Compressed, Divide and Conquer Algorithm for Scalable Distributed Matrix-Matrix Multiplication"],"prefix":"10.1145","author":[{"given":"Majid","family":"Rasouli","sequence":"first","affiliation":[{"name":"School of Computing University of Utah, Utah"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert M.","family":"Kirby","sequence":"additional","affiliation":[{"name":"School of Computing University of Utah, Utah"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hari","family":"Sundar","sequence":"additional","affiliation":[{"name":"School of Computing University of Utah, Utah"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,1,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2015.75"},{"key":"e_1_3_2_1_2_1","unstructured":"Satish Balay Shrirang Abhyankar Mark\u00a0F. Adams Jed Brown Peter Brune Kris Buschelman Lisandro Dalcin Victor Eijkhout William\u00a0D. Gropp Dinesh Kaushik Matthew\u00a0G. Knepley Dave\u00a0A. May Lois\u00a0Curfman McInnes Karl Rupp Barry\u00a0F. Smith Stefano Zampini Hong Zhang and Hong Zhang. 2017. PETSc Web page. http:\/\/www.mcs.anl.gov\/petsc. http:\/\/www.mcs.anl.gov\/petsc  Satish Balay Shrirang Abhyankar Mark\u00a0F. Adams Jed Brown Peter Brune Kris Buschelman Lisandro Dalcin Victor Eijkhout William\u00a0D. Gropp Dinesh Kaushik Matthew\u00a0G. Knepley Dave\u00a0A. May Lois\u00a0Curfman McInnes Karl Rupp Barry\u00a0F. Smith Stefano Zampini Hong Zhang and Hong Zhang. 2017. PETSc Web page. http:\/\/www.mcs.anl.gov\/petsc. http:\/\/www.mcs.anl.gov\/petsc"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/110848244"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342011403516"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9991(82)90057-2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2008.45"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/130948811"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Jeremy Kepner and John Gilbert. 2011. Graph algorithms in the language of linear algebra. SIAM.  Jeremy Kepner and John Gilbert. 2011. Graph algorithms in the language of linear algebra. SIAM.","DOI":"10.1137\/1.9780898719918"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2427023.2427030"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1971.1090789"},{"volume-title":"Performance Evaluation of Sparse Matrix Multiplication Kernels on Intel Xeon Phi","author":"Saule Erik","key":"e_1_3_2_1_12_1","unstructured":"Erik Saule , Kamer Kaya , and \u00dcmit\u00a0 V. \u00c7ataly\u00fcrek . 2014. Performance Evaluation of Sparse Matrix Multiplication Kernels on Intel Xeon Phi . In Parallel Processing and Applied Mathematics, Roman Wyrzykowski, Jack Dongarra, Konrad Karczewski, and Jerzy Wa\u015bniewski (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 559\u2013570. Erik Saule, Kamer Kaya, and \u00dcmit\u00a0V. \u00c7ataly\u00fcrek. 2014. Performance Evaluation of Sparse Matrix Multiplication Kernels on Intel Xeon Phi. In Parallel Processing and Applied Mathematics, Roman Wyrzykowski, Jack Dongarra, Konrad Karczewski, and Jerzy Wa\u015bniewski (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 559\u2013570."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/140952570"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s211-001-8015-y"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1077464.1077466"}],"event":{"name":"HPC Asia 2021: The International Conference on High Performance Computing in Asia-Pacific Region","acronym":"HPC Asia 2021","location":"Virtual Event Republic of Korea"},"container-title":["The International Conference on High Performance Computing in Asia-Pacific Region"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3432261.3432271","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3432261.3432271","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3432261.3432271","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3432261.3432271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:10Z","timestamp":1750193230000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3432261.3432271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,20]]},"references-count":15,"alternative-id":["10.1145\/3432261.3432271","10.1145\/3432261"],"URL":"https:\/\/doi.org\/10.1145\/3432261.3432271","relation":{},"subject":[],"published":{"date-parts":[[2021,1,20]]},"assertion":[{"value":"2021-01-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}