CANNON'S ALGORITHM

In computer science, 'Cannon's algorithm' is a distributed algorithm for matrix multiplication for two-dimensional meshes first described in 1969 ^[1] by Lynn Elliot Cannon.
It is especially suitable for computers laid out in an ''N'' × ''N'' mesh ^[2]. While Cannon's algorithm works well in homogeneous 2D grids, extending it to heterogeneous 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 .

Contents

References

Bibliography

External links

References

1. http://dbpubs.stanford.edu:8090/pub/1994-25
2. http://www.ipp.mpg.de/de/for/bereiche/stellarator/Comp_sci/CompScience/csep/csep1.phy.ornl.gov/la/node6.html
3. http://graal.ens-lyon.fr/~jfpineau/research.html

Bibliography

★ Lynn Elliot Cannon, ''A cellular computer to implement the Kalman Filter Algorithm'', Technical report, Ph.D. Thesis, Montana State University, 14 July 1969.

External links

★ Lecture at Berkeley

★ mu.oz.au