MPI Programming: Write a MPI program in C/C++ to multiply two n-by-n matrices using p processors organized in a ring network with 1 ≤ p ≤ 12. Use the algorithm laid out here: P0 will generate and send ith row-band of A and ith row-band of BT (the transpose of matrix B) to Pi , 1 ≤ i ≤ p − 1 (thus, space allocated should only be to accommodate row-bands of A, BT and C). To compute their row-bands of product matrix C, the processors will use p steps of computation (multiplying row-bands of A and BT producing a block of row-band of C) and (p-1) steps of communication (sending the row-band of BT to the right neighbor and receiving from the left neighbor). You must only use send/receive primitives. P0 finally receives the ith row-bands of product matrix C from Pi , 1 ≤ i ≤ p − 1, and prints it out.
MPI
Write a MPI program in C/C++ to multiply two n-by-n matrices using p processors organized in
a ring network with 1 ≤ p ≤ 12. Use the
and ith row-band of BT (the transpose of matrix B) to Pi
, 1 ≤ i ≤ p − 1 (thus, space allocated should only be to
accommodate row-bands of A, BT and C). To compute their row-bands of product matrix C, the processors will
use p steps of computation (multiplying row-bands of A and BT producing a block of row-band of C) and (p-1)
steps of communication (sending the row-band of BT to the right neighbor and receiving from the left neighbor).
You must only use send/receive primitives. P0 finally receives the ith row-bands of product matrix C from Pi
,
1 ≤ i ≤ p − 1, and prints it out.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
