"Give a hypercube algorithm to compute prefix sums of n numbers if p is the number of nodes and n / p is an integer greater than 1. Assuming that it takes time tadd to add two numbers and time ts to send a message of unit length between two directly-connected nodes, give an exact expression for the total time taken by the algorithm."

Give a Give a hypercube algorithm to compute prefix sums of n numbers if p is the number of nodes and is an integer greater than 1. Assuming that it takes time tadd to add two numbers and time ts to send a message of unit length between two directly-connected nodes, give an exact expression for the total time taken by the algorithm