{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:31:26Z","timestamp":1773329486363,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T00:00:00Z","timestamp":1561507200000},"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":[[2019,6,26]]},"DOI":"10.1145\/3330345.3330357","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T12:14:30Z","timestamp":1560860070000},"page":"127-137","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["A communication-avoiding 3D sparse triangular solver"],"prefix":"10.1145","author":[{"given":"Piyush","family":"Sao","sequence":"first","affiliation":[{"name":"Oak Ridge National Laboratory"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramakrishnan","family":"Kannan","sequence":"additional","affiliation":[{"name":"Oak Ridge National Laboratory"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoye Sherry","family":"Li","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Vuduc","sequence":"additional","affiliation":[{"name":"Georgia Institute of technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M104253X"},{"key":"e_1_3_2_1_2_1","volume-title":"CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE","author":"Baudet G\u00e9rard M","year":"1976","unstructured":"G\u00e9rard M Baudet . Asynchronous iterative methods for multiprocessors. Technical report , CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE , 1976 . G\u00e9rard M Baudet. Asynchronous iterative methods for multiprocessors. Technical report, CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE, 1976."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00103"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536305"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(00)00409-X"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0710032"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(89)90101-4"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210394"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.598277"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1033099"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1516-5_13"},{"key":"e_1_3_2_1_12_1","volume-title":"Communication-avoiding Krylov subspace methods","author":"Hoemmen Mark","year":"2010","unstructured":"Mark Hoemmen . Communication-avoiding Krylov subspace methods . University of California , Berkeley , 2010 . Mark Hoemmen. Communication-avoiding Krylov subspace methods. University of California, Berkeley, 2010."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626402000847"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/523991.938944"},{"key":"e_1_3_2_1_15_1","volume-title":"Family of graph and hypergraph partitioning software","author":"Karypis George","unstructured":"George Karypis and Vipin Kumar . Family of graph and hypergraph partitioning software . http:\/\/glaros.dtc.umn.edu\/gkhome\/views\/metis. Accessed: 2014-01-26. George Karypis and Vipin Kumar. Family of graph and hypergraph partitioning software. http:\/\/glaros.dtc.umn.edu\/gkhome\/views\/metis. Accessed: 2014-01-26."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.117"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975215.9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/645560.658570"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626498000067"},{"key":"e_1_3_2_1_20_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_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00100"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2002.10020"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2014.06.006"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.104"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96983-1_48"}],"event":{"name":"ICS '19: 2019 International Conference on Supercomputing","location":"Phoenix Arizona","acronym":"ICS '19","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the ACM International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3330345.3330357","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3330345.3330357","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:05Z","timestamp":1750204445000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3330345.3330357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,26]]},"references-count":25,"alternative-id":["10.1145\/3330345.3330357","10.1145\/3330345"],"URL":"https:\/\/doi.org\/10.1145\/3330345.3330357","relation":{},"subject":[],"published":{"date-parts":[[2019,6,26]]},"assertion":[{"value":"2019-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}