| |
Message Passing Architecture
for j := 1 to n do
ctmp = 0
for k := 1 to n do
if (k-1 = Pindex)
then
Bkj = 1B[j]
broadcast(Bkj)
else
receive(Bkj)
endif
ctmp = ctmp + 1A(k) * Bkj
endfor
1C[j] = ctmp
endfor |
Minimize Broadcast
for k := 1 to n do
if (k-1 = Pindex)
then
Bk[1 : n] = 1B[1:n]
broadcast(Bk[1 : n])
else
receive(Bk[1 : n])
endif
for j = 1 to n do
1C[j] = 1C[j] + 1A(k) * Bk[j]
endfor
endfor |
|
