Consider the problem of multiplying two n n dense, square matrices A and B to yield the product matrix C = A B. The simple 2-D partitioning to this problem is described as follows. Partition the two n n matrices A and B, respectively, into p blocks (submatrices) Ai,j and Bi,j (0 i, j < p), each of size (n/p0.5) (n/p0.5). Process Pi,j initially stores Ai,j and Bi,j and computes block Ci,j of the result matrix. Computing submatrix Ci,j requires all submatrices Ai,k and Bk,j for 0 k < p0.5, as shown in the figure below