{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:15Z","timestamp":1750220775165,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["7081675,1772593"],"award-info":[{"award-number":["7081675,1772593"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-17-2-0091"],"award-info":[{"award-number":["FA8750-17-2-0091"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008297","name":"Cray Incorporated","doi-asserted-by":"publisher","award":["47277"],"award-info":[{"award-number":["47277"]}],"id":[{"id":"10.13039\/100008297","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,6]]},"DOI":"10.1145\/3350755.3400275","type":"proceedings-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T15:56:12Z","timestamp":1594310172000},"page":"523-525","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Communication-Optimal Tilings for Projective Nested Loops with Arbitrary Bounds"],"prefix":"10.1145","author":[{"given":"Grace","family":"Dinh","sequence":"first","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Demmel","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,9]]},"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":"publisher","DOI":"10.1145\/3317550.3321441"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"M. Christ J. Demmel N. Knight T. Scanlon and K. Yelick. 2013. Communication lower bounds and optimal algorithms for programs that reference arrays - Part 1. arxiv.org\/abs\/1308.0068.  M. Christ J. Demmel N. Knight T. Scanlon and K. Yelick. 2013. Communication lower bounds and optimal algorithms for programs that reference arrays - Part 1. arxiv.org\/abs\/1308.0068.","DOI":"10.21236\/ADA584726"},{"key":"e_1_3_2_1_4_1","volume-title":"Communication-Optimal Convolutional Neural Nets. CoRRabs\/1802.06905","author":"Demmel James","year":"2018","unstructured":"James Demmel and Grace Dinh . 2018. Communication-Optimal Convolutional Neural Nets. CoRRabs\/1802.06905 ( 2018 ). arXiv:1802.06905 http:\/\/arxiv.org\/abs\/1802.06905 James Demmel and Grace Dinh. 2018. Communication-Optimal Convolutional Neural Nets. CoRRabs\/1802.06905 (2018). arXiv:1802.06905 http:\/\/arxiv.org\/abs\/1802.06905"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Grace Dinh and James Demmel. 2020. Communication-Optimal Tilings for Projective Nested Loops with Arbitrary Bounds. arXiv:cs.DS\/2003.00119  Grace Dinh and James Demmel. 2020. Communication-Optimal Tilings for Projective Nested Loops with Arbitrary Bounds. arXiv:cs.DS\/2003.00119","DOI":"10.1145\/3350755.3400275"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2017.05.138"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.108"},{"key":"e_1_3_2_1_9_1","unstructured":"Gennady F. and Louise H. 2019. Intel Math Kernel Library Improved Small Matrix Performance Using Just-in-Time (JIT) Code Generation for Matrix Multiplication(GEMM). https:\/\/software.intel.com\/en-us\/articles\/intel-math-kernel-library-improved-small-matrix-performance-using-just-in-time-jit-code [Online; accessed 27 April 2020].  Gennady F. and Louise H. 2019. Intel Math Kernel Library Improved Small Matrix Performance Using Just-in-Time (JIT) Code Generation for Matrix Multiplication(GEMM). https:\/\/software.intel.com\/en-us\/articles\/intel-math-kernel-library-improved-small-matrix-performance-using-just-in-time-jit-code [Online; accessed 27 April 2020]."},{"key":"e_1_3_2_1_10_1","volume-title":"Anatomy Of High-Performance Deep Learning Convolutions On SIMD Architectures. CoRRabs\/1808.05567","author":"Georganas Evangelos","year":"2018","unstructured":"Evangelos Georganas , Sasikanth Avancha , Kunal Banerjee , Dhiraj D. Kalamkar , Greg Henry , Hans Pabst , and Alexander Heinecke . 2018. Anatomy Of High-Performance Deep Learning Convolutions On SIMD Architectures. CoRRabs\/1808.05567 ( 2018 ). arXiv:1808.05567 http:\/\/arxiv.org\/abs\/1808.05567 Evangelos Georganas, Sasikanth Avancha, Kunal Banerjee, Dhiraj D. Kalamkar, Greg Henry, Hans Pabst, and Alexander Heinecke. 2018. Anatomy Of High-Performance Deep Learning Convolutions On SIMD Architectures. CoRRabs\/1808.05567 (2018). arXiv:1808.05567 http:\/\/arxiv.org\/abs\/1808.05567"},{"volume-title":"Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing","author":"Hong Jia-Wei","key":"e_1_3_2_1_11_1","unstructured":"Jia-Wei Hong and H. T. Kung . 1981. I\/O Complexity: The Red-Blue Pebble Game . In Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing ( Milwaukee, Wisconsin, USA)(STOC '81). Association for Computing Machinery, New York, NY, USA, 326--333. https:\/\/doi.org\/10.1145\/800076.802486 10.1145\/800076.802486 Jia-Wei Hong and H. T. Kung. 1981. I\/O Complexity: The Red-Blue Pebble Game. In Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing(Milwaukee, Wisconsin, USA)(STOC '81). Association for Computing Machinery, New York, NY, USA, 326--333. https:\/\/doi.org\/10.1145\/800076.802486"},{"key":"e_1_3_2_1_12_1","unstructured":"Andrew G. Howard Menglong Zhu Bo Chen Dmitry Kalenichenko Wei-jun Wang Tobias Weyand Marco Andreetto and Hartwig Adam. 2017. MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications.arXiv:cs.CV\/1704.04861  Andrew G. Howard Menglong Zhu Bo Chen Dmitry Kalenichenko Wei-jun Wang Tobias Weyand Marco Andreetto and Hartwig Adam. 2017. MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications.arXiv:cs.CV\/1704.04861"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.03.021"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Auguste Olivry Julien Langou Louis-No\u00ebl Pouchet P. Sadayappan and Fabrice Rastello. 2019. Automated Derivation of Parametric Data Movement Lower Bounds for Affine Programs. arXiv:cs.CC\/1911.06664  Auguste Olivry Julien Langou Louis-No\u00ebl Pouchet P. Sadayappan and Fabrice Rastello. 2019. Automated Derivation of Parametric Data Movement Lower Bounds for Affine Programs. arXiv:cs.CC\/1911.06664","DOI":"10.1145\/3385412.3385989"}],"event":{"name":"SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Virtual Event USA","acronym":"SPAA '20"},"container-title":["Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400275","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3350755.3400275","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3350755.3400275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:21Z","timestamp":1750200081000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":13,"alternative-id":["10.1145\/3350755.3400275","10.1145\/3350755"],"URL":"https:\/\/doi.org\/10.1145\/3350755.3400275","relation":{},"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2020-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}