Ilow mauy steps are ueeded in the tree iuplementation of a barrier, given n proc

Question

Ilow mauy steps are ueeded in the tree iuplementation of a barrier, given n processes? A. n B. 2logzla) D. log2(11) QUESTION 2 2 points If a series of n numbers are distributed over n processes, with each process being assigned one number, the best time complexity that can be achieved by a parallel summation program is Log2(n) QUESTION 3 2 points Whichm best describes the computing mode of the following program that runs on a multiprocessor system? for 0j n j++) i myrank; body(i); barrier(mygroupl; A. synchronous iteration

Explanation / Answer

Question 1: Answer D

Question 2: Answer D

Question 4: Answer C

Question 5: Answer D

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---