Properties of Cannon’s Algorithm
The communication is included in the computation -- compute on the move
Communication is “nearest neighbor”
Processors are fully utilized only in the middle of the computation
Scaling is possible by grouping elements of C
Skewing and staging data is a complication