{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:05Z","timestamp":1750306745438,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,11,17]],"date-time":"2013-11-17T00:00:00Z","timestamp":1384646400000},"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":[[2013,11,17]]},"DOI":"10.1145\/2503210.2503290","type":"proceedings-article","created":{"date-parts":[[2013,10,30]],"date-time":"2013-10-30T12:55:22Z","timestamp":1383137722000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["A framework for load balancing of tensor contraction expressions via dynamic task partitioning"],"prefix":"10.1145","author":[{"given":"Pai-Wei","family":"Lai","sequence":"first","affiliation":[{"name":"The Ohio State University, Columbus, OH"}]},{"given":"Kevin","family":"Stock","sequence":"additional","affiliation":[{"name":"The Ohio State University, Columbus, OH"}]},{"given":"Samyam","family":"Rajbhandari","sequence":"additional","affiliation":[{"name":"The Ohio State University, Columbus, OH"}]},{"given":"Sriram","family":"Krishnamoorthy","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory, Richland, WA"}]},{"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[{"name":"The Ohio State University, Columbus, OH"}]}],"member":"320","published-online":{"date-parts":[[2013,11,17]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"MVAPICH2: MPI over InfiniBand 10GigE\/iWARP and RoCE. http:\/\/mvapich.cse.ohio-state.edu\/. MVAPICH2: MPI over InfiniBand 10GigE\/iWARP and RoCE. http:\/\/mvapich.cse.ohio-state.edu\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1080\/00268970500275780"},{"key":"e_1_3_2_1_3_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-44969-8_5","volume-title":"Drawing Graphs","author":"Bastert Oliver","year":"2001","unstructured":"Oliver Bastert and Christian Matuszewski . Layered drawings of digraphs . In Michael Kaufmann and Dorothea Wagner, editors, Drawing Graphs , volume 2025 of Lecture Notes in Computer Science , pages 87 -- 120 . Springer Berlin Heidelberg , 2001 . Oliver Bastert and Christian Matuszewski. Layered drawings of digraphs. In Michael Kaufmann and Dorothea Wagner, editors, Drawing Graphs, volume 2025 of Lecture Notes in Computer Science, pages 87--120. Springer Berlin Heidelberg, 2001."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840311"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/377792.377814"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512551"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288685"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/9780470125915.ch2","volume-title":"Reviews in Computational Chemistry","author":"Crawford T. D.","year":"2000","unstructured":"T. D. Crawford and H. F. Schaefer , III. An Introduction to Coupled Cluster Theory for Computational Chemists . In Reviews in Computational Chemistry , volume 14 , pages 33 -- 136 . John Wiley and Sons, Inc. , 2000 . T. D. Crawford and H. F. Schaefer, III. An Introduction to Coupled Cluster Theory for Computational Chemists. In Reviews in Computational Chemistry, volume 14, pages 33--136. John Wiley and Sons, Inc., 2000."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2008.44"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654113"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11758501_39"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11428831_20"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1021\/jp034596z"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063481"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2012.04.044"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2287076.2287103"},{"key":"e_1_3_2_1_17_1","series-title":"Monographs in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69897-2","volume-title":"Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness","author":"Mehlhorn Kurt","year":"1984","unstructured":"Kurt Mehlhorn . Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness , volume 2 of Monographs in Theoretical Computer Science . An EATCS Series. Springer , 1984 . Kurt Mehlhorn. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness, volume 2 of Monographs in Theoretical Computer Science. An EATCS Series. Springer, 1984."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342006064504"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342006064503"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2464996.2467282"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1981.4308636"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cpc.2010.04.018"},{"key":"e_1_3_2_1_24_1","volume-title":"van de Geijn and Jerrell Watts. SUMMA: scalable universal matrix multiplication algorithm. Concurrency - Practice and Experience, 9(4):255--274","author":"Robert","year":"1997","unstructured":"Robert A. van de Geijn and Jerrell Watts. SUMMA: scalable universal matrix multiplication algorithm. Concurrency - Practice and Experience, 9(4):255--274 , 1997 . Robert A. van de Geijn and Jerrell Watts. SUMMA: scalable universal matrix multiplication algorithm. Concurrency - Practice and Experience, 9(4):255--274, 1997."}],"event":{"name":"SC13: International Conference for High Performance Computing, Networking, Storage and Analysis","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGARCH ACM Special Interest Group on Computer Architecture","IEEE-CS Computer Society"],"location":"Denver Colorado","acronym":"SC13"},"container-title":["Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2503210.2503290","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2503210.2503290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:21Z","timestamp":1750231701000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2503210.2503290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,17]]},"references-count":23,"alternative-id":["10.1145\/2503210.2503290","10.1145\/2503210"],"URL":"https:\/\/doi.org\/10.1145\/2503210.2503290","relation":{},"subject":[],"published":{"date-parts":[[2013,11,17]]},"assertion":[{"value":"2013-11-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}