Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms
Authors:
- 1 January 2011
- book chapter
- Published by Springer Nature
- p. 90-109
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms2011
- The deep computing messaging framework2008
- Fast linear algebra is stableNumerische Mathematik, 2007
- Communication lower bounds for distributed-memory matrix multiplicationJournal of Parallel and Distributed Computing, 2004
- Memory-Efficient Matrix Multiplication in the BSP ModelAlgorithmica, 1999
- SUMMA: scalable universal matrix multiplication algorithmConcurrency: Practice and Experience, 1997
- Minimizing the communication time for matrix multiplication on multiprocessorsParallel Computing, 1993
- The Fan-Both Family of Column-Based Distributed Cholesky Factorization Algorithms1993
- Communication complexity of PRAMsTheoretical Computer Science, 1990
- Parallel Matrix and Graph AlgorithmsSIAM Journal on Computing, 1981