Pages that link to "Item:Q1886368"

The following pages link to Communication lower bounds for distributed-memory matrix multiplication (Q1886368):

Displaying 20 items.

• A bridging model for multi-core computing (Q619912) (← links)
• Oblivious algorithms for multicores and networks of processors (Q897114) (← links)
• Matrix exponentials and parallel prefix computation in a quantum control problem (Q991127) (← links)
• Distributed control for large-scale systems with adaptive event-triggering (Q1660963) (← links)
• Algebraic methods in the congested clique (Q2010605) (← links)
• HPMaX: heterogeneous parallel matrix multiplication using CPUs and GPUs (Q2212501) (← links)
• A Cache-Optimal Alternative to the Unidirectional Hierarchization Algorithm (Q2808020) (← links)
• Algorithm 953 (Q2828159) (← links)
• Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication (Q2833530) (← links)
• Parallel Matrix Multiplication: A Systematic Journey (Q2954477) (← links)
• REVISITING MATRIX PRODUCT ON MASTER-WORKER PLATFORMS (Q3606550) (← links)
• Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra (Q4637194) (← links)
• Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913) (← links)
• On the cost of iterative computations (Q4993500) (← links)
• Numerical algorithms for high-performance computational science (Q4993515) (← links)
• Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions (Q5157832) (← links)
• Pebbling Game and Alternative Basis for High Performance Matrix Multiplication (Q6087745) (← links)
• Parallel time integration using batched BLAS (Basic Linear Algebra Subprograms) routines (Q6104995) (← links)
• Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation (Q6154935) (← links)
• Massively parallel sparse matrix function calculations with NTPoly (Q6155393) (← links)