Communication lower bounds for distributed-memory matrix multiplication
From MaRDI portal
Publication:1886368
DOI10.1016/j.jpdc.2004.03.021zbMath1114.68081OpenAlexW2010747199WikidataQ57275426 ScholiaQ57275426MaRDI QIDQ1886368
Alexander Tiskin, Dror Irony, Sivan Toledo
Publication date: 18 November 2004
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2004.03.021
Related Items
Distributed control for large-scale systems with adaptive event-triggering, A bridging model for multi-core computing, Parallel Matrix Multiplication: A Systematic Journey, Pebbling Game and Alternative Basis for High Performance Matrix Multiplication, Parallel time integration using batched BLAS (Basic Linear Algebra Subprograms) routines, Oblivious algorithms for multicores and networks of processors, Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation, Massively parallel sparse matrix function calculations with NTPoly, HPMaX: heterogeneous parallel matrix multiplication using CPUs and GPUs, Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra, Algorithm 953, Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions, Algebraic methods in the congested clique, Communication lower bounds and optimal algorithms for numerical linear algebra, Matrix exponentials and parallel prefix computation in a quantum control problem, REVISITING MATRIX PRODUCT ON MASTER-WORKER PLATFORMS, A Cache-Optimal Alternative to the Unidirectional Hierarchization Algorithm, Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication, On the cost of iterative computations, Numerical algorithms for high-performance computational science
Uses Software
