Cannon’s Algorithm (Kung/Leiserson)
•c11 c12 c13          a11 a12 a13 a14
•c21 c22 c23        a21 a22 a23 a24
•c31 c32 c33        a31 a32 a33 a34
•c41 c42 c43    a41 a42 a43 a44
•
•        b13
•    b12 b23
•b11 b22 b33
•b21 b32 b43
•b31 b42
•b41
C is initialized to 0.0
Arrays A, B are skewed
A, B move “across” C one step at a time
Elements arriving at a place are multiplied, added in
Ý
Ü