Communication bounds for convolutional neural networks-Reference-Cited by-同舟云学术

Communication bounds for convolutional neural networks

Published:2022-06-27 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Platform for Advanced Scientific Computing Conference
language:
Short-container-title:

Author:

Chen Anthony¹,Demmel James²,Dinh Grace²,Haberle Mason³,Holtz Olga²

Affiliation:

1. University of Michigan

2. University of California

3. New York University

Funder

University of California, Berkeley College of Letters and Sciences Summer Undergraduate Research Fellowship Math Team Grant

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3539781.3539784

Reference17 articles.

1. Communication lower bounds and optimal algorithms for numerical linear algebra

2. 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]

3. 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]

4. 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.

5. 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.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. AutoDDL: Automatic Distributed Deep Learning With Near-Optimal Bandwidth Cost;IEEE Transactions on Parallel and Distributed Systems;2024-08

2. Mind the Gap: Attainable Data Movement and Operational Intensity Bounds for Tensor Algorithms;2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA);2024-06-29