Parallelize the program of finding the sum of n numbers (a₁+a₂+...+a_n) using different numbers of processes (Algorithm 1: n/2 processors; Algorithm 2: n/log₂n processors).

(1) Draw the diagrams for the implementations of Algorithm 1 and Algorithm 2 respectively.

(2) Find the numbers of operations for the implementations of the sequential algorithm, Algorithm 1, and Algorithm 2 respectively.

(3) Calculate the speedups of Algorithm 1 and Algorithm 2 respectively.

(4) Compute the efficiencies of Algorithm 1 and Algorithm 2 respectively.

(5) Are Algorithm 1 and Algorithm 2 cost optimal respectively? Justify your answer.

Answer rating: 100% (QA)

Certainly I can guide you through the process for each of these steps Step 1 Draw diagrams I cant provide actual diagrams but I can describe them for ... View the full answer