QUESTION 31 2 points Save Answer If we use tree structured communication to dist

Question

QUESTION 31 2 points Save Answer If we use tree structured communication to distribute an array of 16 elements evenly across a set of 8 processes, how many steps are needed to complete the data distribution? O A. 1 O B. 2 0D.4 QUESTION 32 2 points Save Answer Parallel bucket sort algorithm is embarrassingly parallel since little communications among processes are needed. O True O False QUESTION 33 2 points Save Answer If we use tree structured communication to distribute an array of 16 elements evenly across a set of 8 processes, each process compute the partial sum, and then we use the same tree structure to combine partial sums to the root process. how many steps are needed in the communication, including data distribution and partial sum combination? O A. 2 O D.4

Explanation / Answer

Question 31:
Ans: c.3

We need 3 steps to complete data distribution

Question 32:
Ans:False.

Question 33:
Ans: C. 6

Question 35:
Execution time = (p – 1) + m cycles,

Ans: B.Type 1

Question 36:

If a pipeline information to start next process to be passes forward before process has completed all its internal operations,this pipeline is Type 2 pipeline.

Ans: B.Type 2

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

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