{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T18:55:18Z","timestamp":1771959318417,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T00:00:00Z","timestamp":1623974400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100016308","name":"Bpifrance","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100016308","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-19-P3IA-0003"],"award-info":[{"award-number":["ANR-19-P3IA-0003"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2018016"],"award-info":[{"award-number":["2018016"]}],"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,6,19]]},"DOI":"10.1145\/3453483.3454103","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T13:51:32Z","timestamp":1624024292000},"page":"1187-1202","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["IOOpt: automatic derivation of I\/O complexity bounds for affine programs"],"prefix":"10.1145","author":[{"given":"Auguste","family":"Olivry","sequence":"first","affiliation":[{"name":"Universit\u00e9 Grenoble Alpes, France \/ CNRS, France \/ Inria, France"}]},{"given":"Guillaume","family":"Iooss","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Grenoble Alpes, France \/ CNRS, France \/ Inria, France"}]},{"given":"Nicolas","family":"Tollenaere","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Grenoble Alpes, France \/ CNRS, France \/ Inria, France"}]},{"given":"Atanas","family":"Rountev","sequence":"additional","affiliation":[{"name":"Ohio State University, USA"}]},{"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[{"name":"University of Utah, USA"}]},{"given":"Fabrice","family":"Rastello","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Grenoble Alpes, France \/ CNRS, France \/ Inria, France"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/090769156"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2395116.2395121"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3011017"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158120"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.19.4.769"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24644-2_14"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375595"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(88)90002-0"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378859"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Michael Christ James Demmel Nicholas Knight Thomas Scanlon and Katherine Yelick. 2013. Communication Lower Bounds and Optimal Algorithms for Programs that Reference Arrays \u2013 Part 1. arxiv:1308.0068v1.  Michael Christ James Demmel Nicholas Knight Thomas Scanlon and Katherine Yelick. 2013. Communication Lower Bounds and Optimal Algorithms for Programs that Reference Arrays \u2013 Part 1. arxiv:1308.0068v1.","DOI":"10.21236\/ADA584726"},{"key":"e_1_3_2_1_12_1","unstructured":"James Demmel and Grace Dinh. 2018. Communication-Optimal Convolutional Neural Nets. arxiv:1802.06905v2.  James Demmel and Grace Dinh. 2018. Communication-Optimal Convolutional Neural Nets. arxiv:1802.06905v2."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/080731992"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2677010"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2541228.2555309"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/1988220302431"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0038674"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/325478.325479"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626412500107"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802486"},{"key":"e_1_3_2_1_21_1","unstructured":"Intel. 2020. OneAPI Deep Neural Network Library (oneDNN). https:\/\/01.org\/oneDNN  Intel. 2020. OneAPI Deep Neural Network Library (oneDNN). https:\/\/01.org\/oneDNN"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.03.021"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356181"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356218"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.23919\/FPL.2017.8056810"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2541228.2555292"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.103"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3385989"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018743.3018744"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22685-4_12"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2011.12.005"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.690"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2008.5213293"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0030842"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28652-0_6"},{"key":"e_1_3_2_1_36_1","volume-title":"van de Geijn","author":"Smith Tyler Michael","year":"2019","unstructured":"Tyler Michael Smith , Bradley Lowery , Julien Langou , and Robert A . van de Geijn . 2019 . A Tight I\/O Lower Bound for Matrix Multiplication . arxiv:1702.02017v2. Tyler Michael Smith, Bradley Lowery, Julien Langou, and Robert A. van de Geijn. 2019. A Tight I\/O Lower Bound for Matrix Multiplication. arxiv:1702.02017v2."},{"key":"e_1_3_2_1_37_1","unstructured":"Paul Springer and Paolo Bientinesi. 2016. Design of a High-Performance GEMM-like Tensor-Tensor Multiplication. arxiv:1607.00145.  Paul Springer and Paolo Bientinesi. 2016. Design of a High-Performance GEMM-like Tensor-Tensor Multiplication. arxiv:1607.00145."},{"key":"e_1_3_2_1_38_1","volume-title":"ISL: An Integer Set Library for the Polyhedral Model. In Mathematical Software\u2013ICMS","author":"Verdoolaege Sven","year":"2010","unstructured":"Sven Verdoolaege . 2010 . ISL: An Integer Set Library for the Polyhedral Model. In Mathematical Software\u2013ICMS 2010. 299\u2013302. Sven Verdoolaege. 2010. ISL: An Integer Set Library for the Polyhedral Model. In Mathematical Software\u2013ICMS 2010. 299\u2013302."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2400682.2400713"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-1231-0"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0559-y"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4337-4"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772954.1772982"}],"event":{"name":"PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","location":"Virtual Canada","acronym":"PLDI '21","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3453483.3454103","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3453483.3454103","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3453483.3454103","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3453483.3454103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:48Z","timestamp":1750193268000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3453483.3454103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,18]]},"references-count":43,"alternative-id":["10.1145\/3453483.3454103","10.1145\/3453483"],"URL":"https:\/\/doi.org\/10.1145\/3453483.3454103","relation":{},"subject":[],"published":{"date-parts":[[2021,6,18]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}