7 points Consider the cost-optimal parallel algorithm of adding n numbers using p processors. Assume that adding two numbers takes one unit of time, and communicating one number between two processing elements takes one unit of time. Compute speedup and efficiency of this parallel algorithm considering a. p-4 and n-64 bp-4 and n=192 [Note: There are two variants of parallel programs for adding n numbers. Consider the cost-optimal one. For computation of parallel processing time, do not consider directly the asymptotic time complexity which is given in the book. You need to consider precisely the serial computation time and message communication time along with other parameters such as n (total numbers) and p (total processors).] Your answer Back Submit