Joint-Communication Optimal Matrix Multiplication with Asymmetric Memories
- 1 May 2025
- journal article
- research article
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 40 (3) , 835-854
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Efficient distributed algorithms for holistic aggregation functions on random regular graphsScience China Information Sciences, 2021
- A nearly optimal distributed algorithm for computing the weighted girthScience China Information Sciences, 2021
- Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication2013
- Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms2011
- Avoiding communication in sparse matrix computations2008 IEEE International Symposium on Parallel and Distributed Processing, 2008
- Collective communication: theory, practice, and experienceConcurrency and Computation: Practice and Experience, 2007
- Communication lower bounds for distributed-memory matrix multiplicationJournal of Parallel and Distributed Computing, 2004
- Critical path analysis for the execution of parallel and distributed programs2003
- ScaLAPACK: a scalable linear algebra library for distributed memory concurrent computers2003
- An inequality related to the isoperimetric inequalityBulletin of the American Mathematical Society, 1949