Fox’s Algorithm
Assume that the matrices have order n and that P=n^2
Assign a_i,j, b_i,j, c_i,j to process i*n+j [= (i,j)]
Algorithm proceeds in n stages: one stage for each a_i,k * b_k,j for k=0,…,n-1
Stage k on process (i,j): kbar = (i+k)mod n c_i,j = c_i,j + a_i,kbar * b_kbar,j
Need to make sure that information is in the right location at the right time …