In this paper, we derive an efficient parallel algorithm to solve the single function coarsest partition problem. This algorithm runs in O(log(2)n) time using O(nlogn) operations on the EREW PRAM with O(n) memory cell...
详细信息
In this paper, we derive an efficient parallel algorithm to solve the single function coarsest partition problem. This algorithm runs in O(log(2)n) time using O(nlogn) operations on the EREW PRAM with O(n) memory cells used. Compared,vith the previous PRAM algorithms that consume O(n(1+epsilon)) memory cells for some positive constant epsilon >0, our algorithm consumes less memory cells without increasing the total number of operations.
暂无评论