Live briefing
Everything about Cannon's algorithm
Algorithm for matrix multiplication
In computer science, Cannon's algorithm is a distributed algorithm for matrix multiplication for two-dimensional meshes first described in 1969 by Lynn Elliot Cannon. Wikipedia →
đź§ Start here: a 6-step reading path
- Read the overview: Cannon's algorithmA 5-minute orientation
- Pick up a classic book: Parallel Programming in C with MPI and OpenMPThe most-reprinted book on the subject
- Go sideways: Matrix multiplication algorithmA closely related topic
- Go sideways: Hierarchical matrixA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
- No matching papers found.
📚 Books worth reading
Parallel Programming in C with MPI and OpenMPMichael J. Quinn · 2003- 📕Tomashi JacksonTomashi Jackson, Corinne Erni · 2021
- 📕Bodily instruments and instrumental bodiesFranziska Schroeder · 2006
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Matrix multiplication algorithm Because matrix multiplication is such a central operation in many numerical algorithms, much work has been invested in making matrix multiplication algorithms…
- Hierarchical matrix In numerical mathematics, hierarchical matrices (H-matrices) are used as data-sparse approximations of non-sparse matrices. While a sparse matrix of dimension…
- Circulant matrix In linear algebra, a circulant matrix is a square matrix in which each row is a cyclic shift, by one position, of the row above it. Equivalently, its entries…
- Smith normal form In mathematics, the Smith normal form (sometimes abbreviated SNF) is a normal form that can be defined for any matrix (not necessarily square) with entries…
- LU decomposition In numerical analysis and linear algebra, lower–upper (LU) decomposition or factorization factors a matrix as the product of a lower triangular matrix…
- Strassen algorithm In linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm for matrix multiplication. It is faster than the standard matrix…
- Householder transformation In linear algebra, a Householder transformation (also known as a Householder reflection or elementary reflector) is a linear transformation that describes…
- Data parallelism Data parallelism is parallelization across multiple processors in parallel computing environments. It focuses on distributing the data across different…