An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem on the EREW PRAM

In this paper, we derive an efficient parallel algorithm to solve the single function coarsest partition problem. This algorithm runs in O(log2n) time using O(nlogn) operations on the EREW PRAM with O(n) memory cells used. Compared with the previous PRAM algorithms that consume O(n1+ε) memory cells for some positive constant ε > 0, our algorithm consumes less memory cells without increasing the total number of operations.