{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T16:52:10Z","timestamp":1791478330527,"version":"4.3.4"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,11,12]],"date-time":"2011-11-12T00:00:00Z","timestamp":1321056000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Krell Department of Energy Computational Science Graduate Fellowship","award":["DE-FG02-97ER25308"],"award-info":[{"award-number":["DE-FG02-97ER25308"]}]},{"DOI":"10.13039\/100002418","name":"Intel Corporation","doi-asserted-by":"publisher","award":["24894"],"award-info":[{"award-number":["24894"]}],"id":[{"id":"10.13039\/100002418","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004318","name":"Microsoft","doi-asserted-by":"publisher","award":["24263"],"award-info":[{"award-number":["24263"]}],"id":[{"id":"10.13039\/100004318","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005595","name":"University of California","doi-asserted-by":"publisher","award":["IG07-10227"],"award-info":[{"award-number":["IG07-10227"]}],"id":[{"id":"10.13039\/100005595","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0003959DE-SC0004938DE-FC02-06-ER25786DE-SC0001845"],"award-info":[{"award-number":["DE-SC0003959DE-SC0004938DE-FC02-06-ER25786DE-SC0001845"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,11,12]]},"DOI":"10.1145\/2063384.2063487","type":"proceedings-article","created":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T08:32:09Z","timestamp":1320741129000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["Improving communication performance in dense linear algebra via topology aware collectives"],"prefix":"10.1145","author":[{"given":"Edgar","family":"Solomonik","sequence":"first","affiliation":[{"name":"University of California at Berkeley, Berkeley, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abhinav","family":"Bhatele","sequence":"additional","affiliation":[{"name":"Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Demmel","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, Berkeley, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,11,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.395.0575"},{"key":"e_1_3_2_1_2_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.1145\/215399.215427"},{"key":"e_1_3_2_1_4_1","volume-title":"Mat. Anal. Appl","author":"Ballard G.","year":"2011","unstructured":"G. Ballard , J. Demmel , O. Holtz , and O. Schwartz . Minimizing communication in linear algebra. To appear in SIAM J . Mat. Anal. Appl , 2011 . G. Ballard, J. Demmel, O. Holtz, and O. Schwartz. Minimizing communication in linear algebra. To appear in SIAM J. Mat. Anal. Appl, 2011."},{"key":"e_1_3_2_1_5_1","volume-title":"USA","author":"Barnett M.","year":"1993","unstructured":"M. Barnett , D. G. Payne , R. A. van de Geijn, and J. Watts. Broadcasting on meshes with worm-hole routing. Technical report, Austin, TX , USA , 1993 . M. Barnett, D. G. Payne, R. A. van de Geijn, and J. Watts. Broadcasting on meshes with worm-hole routing. Technical report, Austin, TX, USA, 1993."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(89)90091-4"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/265932"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/155332.155333"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2009.12"},{"key":"e_1_3_2_1_10_1","first-page":"1","volume-title":"Communication avoiding Gaussian Elimination","author":"Grigori L.","year":"2008","unstructured":"L. Grigori , J. W. Demmel , and H. Xiang . Communication avoiding Gaussian Elimination . pages 29: 1 -- 29 :12, 2008 . L. Grigori, J. W. Demmel, and H. Xiang. Communication avoiding Gaussian Elimination. pages 29:1--29:12, 2008."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(06)80021-9"},{"key":"e_1_3_2_1_12_1","first-page":"3","article-title":"Trading replication for communication in parallel distributed-memory dense solvers","volume":"71","author":"Irony D.","year":"2002","unstructured":"D. Irony and S. Toledo . Trading replication for communication in parallel distributed-memory dense solvers . Parallel Processing Letters , 71 : 3 -- 28 , 2002 . D. Irony and S. Toledo. Trading replication for communication in parallel distributed-memory dense solvers. Parallel Processing Letters, 71:3--28, 2002.","journal-title":"Parallel Processing Letters"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.29465"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2008.19"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375527.1375544"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.476198"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-007-0012-0"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342005051521"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.341"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1096-9128(199704)9:4<255::AID-CPE250>3.0.CO;2-2"}],"event":{"name":"SC '11: International Conference for High Performance Computing, Networking, Storage and Analysis","location":"Seattle Washington","acronym":"SC '11","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","IEEE-CS Computer Society"]},"container-title":["Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063384.2063487","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2063384.2063487","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:06:08Z","timestamp":1750226768000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063384.2063487"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,12]]},"references-count":20,"alternative-id":["10.1145\/2063384.2063487","10.1145\/2063384"],"URL":"https:\/\/doi.org\/10.1145\/2063384.2063487","relation":{},"subject":[],"published":{"date-parts":[[2011,11,12]]},"assertion":[{"value":"2011-11-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}