QUESTION 6 2 points Save Answer The tree structured implementation of the barmie

Question

QUESTION 6 2 points Save Answer The tree structured implementation of the barmier routine has time complexity (where P is the number of processes) B.OP) D. 0(logP) QUESTION 7 2 points Save Answer MPI Barrier routine is a O A blocking and collective communication O B. blocking and point-to-point communication routine. C. nonblocking and poin o-point communication 0 D. nonblocking and collective communication QUESTION 8 2 points Save Answer How many steps are needed in the tree implementation of a barrier, given n processes? A. 2n B. login) D. 210g2(n)

Explanation / Answer

Q 6) b) O(P)

Q 7) MPI barrier routine is a blocking and colloective communication

Q 8) a) 2n

Q9) d) log2(N)

Q 10) d) both processes use non blocking send routine

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---