Fast computation of maximum最大的快速计算.pptVIP

Lecture 4 : Accelerated Cascading and Parallel List Ranking We will first discuss a technique called accelerated cascading for designing very fast parallel algorithms. We will then study a very important technique for ranking the elements of a list in parallel. Fast computation of maximum Input: An array A holding p elements from a linearly ordered universe S. We assume that all the elements in A are distinct. Output: The maximum element from the array A. We use a boolean array M such that M(k)=1 if and only if A(k) is the maximum element in A. Initialization: We allocate p processors to set each entry in M to 1. Fast computation of maximum Step 1: Assign p processors for each element in A, p2 processors overall. Consider the p processors allocated to A(j). We name these processors as P1, P2,..., Pi,..., Pp. Pi compares A(j) with A(i) : If A(i) A(j) then M(j) := 0 else do nothing. Fast computation of maximum Step 2: At the end of Step 1, M(k) , 1 ? k ? p will be 1 if and only if A(k) is the maximum element. We allocate p processors, one for each entry in M. If the entry is 0, the processor does nothing. If the entry is 1, it outputs the index k of the maximum element. Fast computation of maximum Complexity: The processor requirement is p2 and the time complexity is O(1). We need concurrent write facility and hence the Common CRCW PRAM model. Optimal computation of maximum This is the same algorithm which we used for adding n numbers. Optimal computation of maximum This algorithm takes O(n) processors and O(log n) time. We can reduce the processor complexity to O(n / log n). Hence the algorithm does optimal O(n) work. An O(log log n) time algorithm Instead of a binary tree, we use a more complex tree. Assume that . The root of the tree has children. Each node at the i-th level has children for . Each node at level k has two children. An O(log log n) time algorithm Some Properties The depth of the tree i