Jump to content

Cannon's algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Xezbeth (talk | contribs) at 19:55, 1 July 2007 (cat). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computer science, Cannon's algorithm is a distributed algorithm for matrix multiplication for 2D meshes first described in 1969 [1] by Lynn Elliot Cannon.

It is especially suitable for computers laid out in an N x N mesh [2]. While Cannon's aqlgorithm works well in homogenous 2D grids, extending it to heterogenous 2D grids has been proven to be difficult [3].

The main advantage of the algorithm is that its storage requirements remain constant and are independent of the number of processors [1].

References

Bibliography