1.Devise formulas for the functions that calculate my first i and my last i in the global sum example. Remember that each core should be assigned roughly the same number of elements of computations in the loop. Hint: First consider the case when n is evenly divisible by p.
2. We've implicitly assumed that each call to Compute next value requires roughly the same amount of work as the other calls. How would you change your answer to the preceding question if call i = k requires k+1 times as much work as the call with i = 0? So if the first call (i = 0) requires 2 milliseconds,the second call (i = 1) requires 4, the third (i =2) requires 6, and so on.
3.Derive formulas for the number of receives and additions that core 0 carries out using
a. the original pseudo-code for a global sum, and
b. the tree-structured global sum.
Make a table showing the numbers of receives and additions carried out by core
0 when the two sums are used with 2, 4, 8, : : : ,1024 cores.