{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:14:54Z","timestamp":1750220094652,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T00:00:00Z","timestamp":1656288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"University of California, Berkeley College of Letters and Sciences Summer Undergraduate Research Fellowship Math Team Grant"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,27]]},"DOI":"10.1145\/3539781.3539784","type":"proceedings-article","created":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T16:23:27Z","timestamp":1657643007000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Communication bounds for convolutional neural networks"],"prefix":"10.1145","author":[{"given":"Anthony","family":"Chen","sequence":"first","affiliation":[{"name":"University of Michigan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Demmel","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grace","family":"Dinh","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mason","family":"Haberle","sequence":"additional","affiliation":[{"name":"New York University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Holtz","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492914000038"},{"key":"e_1_3_2_1_2_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 - Part 1. arXiv:1308.0068 [math.CA]  Michael Christ James Demmel Nicholas Knight Thomas Scanlon and Katherine Yelick. 2013. Communication lower bounds and optimal algorithms for programs that reference arrays - Part 1. arXiv:1308.0068 [math.CA]","DOI":"10.21236\/ADA584726"},{"key":"e_1_3_2_1_3_1","unstructured":"Michael Christ James Demmel Nicholas Knight Thomas Scanlon and Katherine Yelick. 2015. On Holder-Brascamp-Lieb inequalities for torsion-free discrete Abelian groups. arXiv:1510.04190 [math.CA]  Michael Christ James Demmel Nicholas Knight Thomas Scanlon and Katherine Yelick. 2015. On Holder-Brascamp-Lieb inequalities for torsion-free discrete Abelian groups. arXiv:1510.04190 [math.CA]"},{"volume-title":"The Future of Computing Performance: Game Over or Next Level? The National Academies Press","author":"National Research Council. 2011.","key":"e_1_3_2_1_4_1","unstructured":"National Research Council. 2011. The Future of Computing Performance: Game Over or Next Level? The National Academies Press , Washington, DC . National Research Council. 2011. The Future of Computing Performance: Game Over or Next Level? The National Academies Press, Washington, DC."},{"key":"e_1_3_2_1_5_1","volume-title":"Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication. In 2013 IEEE 27th International Symposium on Parallel and Distributed Processing. 261--272","author":"Demmel James","year":"2013","unstructured":"James Demmel , David Eliahu , Armando Fox , Shoaib Kamil , Benjamin Lipshitz , Oded Schwartz , and Omer Spillinger . 2013 . Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication. In 2013 IEEE 27th International Symposium on Parallel and Distributed Processing. 261--272 . James Demmel, David Eliahu, Armando Fox, Shoaib Kamil, Benjamin Lipshitz, Oded Schwartz, and Omer Spillinger. 2013. Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication. In 2013 IEEE 27th International Symposium on Parallel and Distributed Processing. 261--272."},{"key":"e_1_3_2_1_6_1","unstructured":"James Demmel and Alex Rusciano. 2016. Parallelepipeds obtaining HBL lower bounds. arXiv:1611.05944 [cs.DS]  James Demmel and Alex Rusciano. 2016. Parallelepipeds obtaining HBL lower bounds. arXiv:1611.05944 [cs.DS]"},{"key":"e_1_3_2_1_7_1","unstructured":"Venmugil Elango. 2016. Techniques for Characterizing the Data Movement Complexity of Computations.  Venmugil Elango. 2016. Techniques for Characterizing the Data Movement Complexity of Computations."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18074.2021.9586216"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA52012.2021.00050"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2018.00014"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356181"},{"key":"e_1_3_2_1_13_1","unstructured":"Lingchuan Meng and John Brothers. 2019. Efficient Winograd Convolution via Integer Arithmetic. arXiv:1901.01965 [cs.NE]  Lingchuan Meng and John Brothers. 2019. Efficient Winograd Convolution via Integer Arithmetic. arXiv:1901.01965 [cs.NE]"},{"volume-title":"High Performance and Portable Convolution Operators for Multicore Processors. In 2020 IEEE 32nd International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD). 91--98","author":"Juan Pablo San","key":"e_1_3_2_1_14_1","unstructured":"Pablo San Juan , Adri\u00e1n Castell\u00f3 , Manuel F. Dolz , Pedro Alonso-Jord\u00e1 , and Enrique S . Quintana-Ort\u00ed. 2020 . High Performance and Portable Convolution Operators for Multicore Processors. In 2020 IEEE 32nd International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD). 91--98 . Pablo San Juan, Adri\u00e1n Castell\u00f3, Manuel F. Dolz, Pedro Alonso-Jord\u00e1, and Enrique S. Quintana-Ort\u00ed. 2020. High Performance and Portable Convolution Operators for Multicore Processors. In 2020 IEEE 32nd International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD). 91--98."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-2010-045-2"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378514"},{"volume-title":"The Anatomy of Efficient FFT and Winograd Convolutions on Modern CPUs (ICS '19)","author":"Zlateski Aleksandar","key":"e_1_3_2_1_17_1","unstructured":"Aleksandar Zlateski , Zhen Jia , Kai Li , and Fredo Durand . 2019. The Anatomy of Efficient FFT and Winograd Convolutions on Modern CPUs (ICS '19) . Association for Computing Machinery , New York, NY, USA , 414--424. Aleksandar Zlateski, Zhen Jia, Kai Li, and Fredo Durand. 2019. The Anatomy of Efficient FFT and Winograd Convolutions on Modern CPUs (ICS '19). Association for Computing Machinery, New York, NY, USA, 414--424."}],"event":{"name":"PASC '22: Platform for Advanced Scientific Computing Conference","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","CSCS Swiss National Supercomputing Centre"],"location":"Basel Switzerland","acronym":"PASC '22"},"container-title":["Proceedings of the Platform for Advanced Scientific Computing Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3539781.3539784","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3539781.3539784","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:02Z","timestamp":1750183802000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3539781.3539784"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,27]]},"references-count":17,"alternative-id":["10.1145\/3539781.3539784","10.1145\/3539781"],"URL":"https:\/\/doi.org\/10.1145\/3539781.3539784","relation":{},"subject":[],"published":{"date-parts":[[2022,6,27]]},"assertion":[{"value":"2022-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}