2) To run an MPI program on a linear array of 4 nodes, what allocation of proces

Question

2) To run an MPI program on a linear array of 4 nodes, what allocation of processes (viz., the list of the ranks of the processes allocated on each node of the linear array) is possible?
A. 0 1 2 3
B. 3 2 1 0
C. 1 2 3 4
D. A and B

3) Suppose that node A is sending an n-packet message to node B in a distributed-memory system with a static network. Also suppose that the message must be forwarded through k intermediate nodes. The startup time is s and the time for transmitting one packet to a nearby node is c. What is the most proper formula for calculating the time for the above communication?
A. s + k c + n - 1
B. s + k n c
C. k n (s + c)
D. s + (k + n) c

4) Which one of the following is NOT a collective communication function?
A. MPI_Send
B. MPI_Reduce
C. MPI_Bcast
D. MPI_All

Explanation / Answer

2) C. 1 2 3 4

3)

4) A. MPI_Send

Related Questions

Navigate

• Browse (All)
• Browse 2
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.