Question: Consider the problem of writing a parallel algorithm to compute the sum of n numbers a1,..., On by using a pairwise summation strategy illustrated here
Consider the problem of writing a parallel algorithm to compute the sum of n numbers a1,..., On by using a pairwise summation strategy illustrated here with an example for n= 8: the 8 mumbers: 7,3, 15, 10, 13, 18, 6, 4 sum to 76. 76 35 41 Time 10 25 31 10 7 3 15 18 6 4 10 13 Array elements 1. Design a parallel algorithm to compute the sum of n numbers, using the aforementioned strategy. 2. Describe in detail your parallel algorithm using pseudocode only, not C/MPI. 3. Mention explicitly which computations of your algorithm can be performed in parallel. 4. For n= 8 the height of the tree is equal to 3. What is the height of the tree for arbitrary n? 5. When the n numbers are given, how many processors are needed (at least) for your parallel algorithm to work properly
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
