I/O-Optimal Algorithms for Symmetric Linear Algebra Kernels
Author:
Affiliation:
1. Inria Centre at the University of Bordeaux, Bordeaux, France
2. University of Colorado Denver, Denver, CO, USA
Funder
Agence Nationale de la Recherche, France
Publisher
ACM
Link
https://dl.acm.org/doi/pdf/10.1145/3490148.3538587
Reference18 articles.
1. Communication lower bounds and optimal algorithms for numerical linear algebra
2. Grey Ballard , James Demmel , Olga Holtz , and Oded Schwartz . 2009. Communication-optimal Parallel and Sequential Cholesky Decomposition. CoRR abs/0902.2537 ( 2009 ). Grey Ballard, James Demmel, Olga Holtz, and Oded Schwartz. 2009. Communication-optimal Parallel and Sequential Cholesky Decomposition. CoRR abs/0902.2537 (2009).
3. Communication-optimal Parallel and Sequential Cholesky Decomposition
4. Minimizing Communication in Numerical Linear Algebra
5. Out-of-Core Implementations of Cholesky Factorization: Loop-Based versus Recursive Algorithms
Cited by 5 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. Parallel Memory-Independent Communication Bounds for SYRK;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17
3. Data Distribution Schemes for Dense Linear Algebra Factorizations on Any Number of Nodes;2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2023-05
4. On the Arithmetic Intensity of Distributed-Memory Dense Matrix Multiplication Involving a Symmetric Input Matrix (SYMM);2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2023-05
5. 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
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3