Cannon's algorithm
Encyclopedia
In computer science
, Cannon's algorithm is a distributed algorithm for matrix multiplication
for two-dimensional mesh
es first described in 1969 by Lynn Elliot Cannon.
It is especially suitable for computers laid out in an N × N mesh. While Cannon's algorithm works well in homogeneous 2D grids, extending it to heterogeneous 2D grids has been proven to be difficult.
The main advantage of the algorithm is that its storage requirements remain constant and are independent of the number of processors.
Computer science
Computer science or computing science is the study of the theoretical foundations of information and computation and of practical techniques for their implementation and application in computer systems...
, Cannon's algorithm is a distributed algorithm for matrix multiplication
Matrix multiplication
In mathematics, matrix multiplication is a binary operation that takes a pair of matrices, and produces another matrix. If A is an n-by-m matrix and B is an m-by-p matrix, the result AB of their multiplication is an n-by-p matrix defined only if the number of columns m of the left matrix A is the...
for two-dimensional mesh
Mesh
Mesh consists of semi-permeable barrier made of connected strands of metal, fiber, or other flexible/ductile material. Mesh is similar to web or net in that it has many attached or woven strands.-Types of mesh:...
es first described in 1969 by Lynn Elliot Cannon.
It is especially suitable for computers laid out in an N × N mesh. While Cannon's algorithm works well in homogeneous 2D grids, extending it to heterogeneous 2D grids has been proven to be difficult.
The main advantage of the algorithm is that its storage requirements remain constant and are independent of the number of processors.