= Cannon's algorithm
{wiki=Cannon's_algorithm}
Cannon's algorithm is a method for matrix multiplication that is designed to be efficient on distributed memory systems, and particularly for systems with a grid structure, such as clusters of computers or multicomputer architectures. Developed by the computer scientist William J. Cannon in 1969, the algorithm leverages the concept of data locality and aims to reduce communication overhead, making it suitable for parallel processing. \#\#\# Overview of Cannon's Algorithm 1.
Back to article page