Author:
Christ Michael,Demmel James,Knight Nicholas,Scanlon Thomas,Yelick Katherine A.
Publisher
Defense Technical Information Center
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Tightening I/O Lower Bounds through the Hourglass Dependency Pattern;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
2. Communication Lower Bounds for Nested Bilinear Algorithms via Rank Expansion of Kronecker Products;Foundations of Computational Mathematics;2023-11-06
3. Symmetric Block-Cyclic Distribution: Fewer Communications Leads to Faster Dense Cholesky Factorization;SC22: International Conference for High Performance Computing, Networking, Storage and Analysis;2022-11
4. Communication bounds for convolutional neural networks;Proceedings of the Platform for Advanced Scientific Computing Conference;2022-06-27
5. Pebbles, Graphs, and a Pinch of Combinatorics;Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures;2021-07-06