Parallel Processing

I provided the figure 1.1 under the question

3. Write a pseudo-code for the tree-structured global sum illustrated in Fig. 1.1 (copy attached). Assume that the number of processors (cores) is a power of two (1,2,4,8,). Hints: Use a variable divisor to determine whether a processor should send its sum or receive and add. The divisor should start with the value 2 and be doubled after each iteration. Also use a variable core_difference to determine which processor should be partnered with the current processor. It should start with the value1 and also be doubled after each iteration. For example, in the first iteration, 0% divisor =0 and 1% divisor =1, so 0 receives and adds, while 1 sends. Also in the first iteration 0+ core_difference =1 and 1 -core_difference =0, so 0 and 1 are paired in the first iteration. Cores FIGURE