Parallel Memory-Independent Communication Bounds for SYRK-Reference-Cited by-同舟云学术

Parallel Memory-Independent Communication Bounds for SYRK

Published:2023-06-17 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Al Daas Hussam¹^ORCID,Ballard Grey²^ORCID,Grigori Laura³^ORCID,Kumar Suraj⁴^ORCID,Rouse Kathryn⁵^ORCID

Affiliation:

1. Rutherford Appleton Laboratory, Didcot, United Kingdom

2. Wake Forest University, Winston-Salem, NC, USA

3. Inria Paris, Paris, France

4. Inria Lyon, Lyon, France

5. Inmar Intelligence, Winston-Salem, NC, USA

Funder

National Science Foundation

European Research Council

Advanced Scientific Computing Research

Publisher

ACM

Link

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

Reference23 articles.

1. 1990;Aggarwal A.;Communication Complexity of PRAMs. Theor. Comp. Sci.,1990

2. H. Al Daas , G. Ballard , L. Grigori , S. Kumar , and K. Rouse . 2022 . Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds. In SPAA 2022 . https://doi.org/10.1145/3490148.3538552 10.1145/3490148.3538552 H. Al Daas, G. Ballard, L. Grigori, S. Kumar, and K. Rouse. 2022. Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds. In SPAA 2022. https://doi.org/10.1145/3490148.3538552

3. 2014;Ballard G.;Acta Numerica,2014

4. G. Ballard , J. Demmel , O. Holtz , B. Lipshitz , and O. Schwartz . 2012 . Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds. In SPAA 2012 . https://doi.org/10.1145/231 2005 .2312021 10.1145/2312005.2312021 G. Ballard, J. Demmel, O. Holtz, B. Lipshitz, and O. Schwartz. 2012. Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds. In SPAA 2012. https://doi.org/10.1145/2312005.2312021

5. Minimizing Communication in Numerical Linear Algebra