Parallelizing algorithms and finding the number of words each processor needs

Assuming that m = n = p is divisible by 4, and that 4 processors are computing the matrix-matrix multiplication C = AB where A, B, C are n x n matrices.

Algorithm1:

function C = MatMult3(A, B)

[n, n] = size(A);

[n, n] = size(B);

C = zeros(n, n);

for j = 1 : n

C(:, j) = A * B(:, j);

end

a) How to parallelize this assuming m = n = p is divisible by 4?

Algorithm 2:

function C = MatMult4(A, B)

[n, n] = size(A);

[n, n] = size(B);

C = zeros(n, n);

for k = 1 : n

C = C + A(:, k) * B(k, :);

end

b) How to parallelize this assuming m = n = p is divisible by 4?

And how to parallelize in the case of a square block version?

c) Find the number of words that each processor needs to compute its part.

d) Find the number of flops that each processor computes in parallel.

[Steven Lord]

This sounds like a homework assignment. If it is, show us the code you've written to try to solve the problem and ask a specific question about where you're having difficulty and we may be able to provide some guidance.

If you aren't sure where to start because you're not familiar with how to write MATLAB code, I suggest you start with the MATLAB Onramp tutorial (https://www.mathworks.com/support/learn-with-matlab-tutorials.html) to quickly learn the essentials of MATLAB.

If you aren't sure where to start because you're not familiar with the mathematics you'll need to solve the problem, I recommend asking your professor and/or teaching assistant for help.