Consider the message-passing formulation of the quicksort algorithm presented in Section 9.4.3 . Compute the exact (that is, using ts , t w , and tc ) parallel run time and efficiency of the algorithm under the assumption of perfect pivots. Compute the various components of the is o efficiency function of your formulation when
for cases in which the desired efficiency is 0.50, 0.75, and 0.95. Does the scalability of this formulation depend on the desired efficiency and the architectural characteristics of the machine?