Input: A n 1+1 /2 = n 3/2 processor CRCW PRAM, and n integers x 1 ,
Fantastic news! We've Found the answer you've been seeking!
Question:
Input: A n1+1/2 = n3/2 processor CRCW PRAM, and n integers x1, … , xn.
Output: The maximum value on the input variables, i.e. x = max{x1, x2, …, xn}.
Give a constant time CRCW PRAM algorithm that finds the maximum of n integer variables using n3/2 processor only (i.e. significantly fewer processors than the algorithm presented in class).
Hint: Note that n1/2 (n1/2)2 = n3/2.
Expert Answer:
Related Book For 
Posted Date:
