Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication

Published:2012 Issue: Volume: Page:13-36
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Ballard Grey,Demmel James,Holtz Olga,Lipshitz Benjamin,Schwartz Oded

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-34862-4_2.pdf

Reference36 articles.

1. Alon, N., Schwartz, O., Shapira, A.: An elementary construction of constant-degree expanders. Combinatorics, Probability & Computing 17(3), 319–327 (2008)

2. Ballard, G., Demmel, J., Holtz, O., Lipshitz, B., Schwartz, O.: Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds. In: Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2012, pp. 77–79. ACM, New York (2012)

3. Ballard, G., Demmel, J., Holtz, O., Lipshitz, B., Schwartz, O.: Communication-optimal parallel algorithm for Strassen’s matrix multiplication. In: Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2012, pp. 193–204. ACM, New York (2012)

4. Ballard, G., Demmel, J., Holtz, O., Schwartz, O.: Minimizing communication in numerical linear algebra. SIAM J. Matrix Analysis Applications 32(3), 866–901 (2011)

5. Ballard, G., Demmel, J., Holtz, O., Schwartz, O.: Graph expansion and communication costs of fast matrix multiplication. J. ACM (accepted, 2012)

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

1. Computation of Matrix Chain Products on Parallel Machines;2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2019-05

2. Revisiting the I/O-Complexity of Fast Matrix Multiplication with Recomputations;2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2019-05

3. Fast matrix multiplication and its algebraic neighbourhood;Sbornik: Mathematics;2017-11

4. The I/O Complexity of Strassen’s Matrix Multiplication with Recomputation;Lecture Notes in Computer Science;2017

5. Write-Avoiding Algorithms;2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2016-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3