In this paper, we consider the problem of selection on coarse-grained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for paralle...
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
We show that selection on an input of size N can be performed on a P-node hypercube (P = N/(log N)) in time O(N/P) with high probability, provided each node can process all the in...
The mesh-connected array is an attractive architecture for parallel machines, and a number of existing parallel machines are based on a mesh topology. In this paper, we survey the ...
A survey of results for the problems of selection, mergingand sorting in the Randomized Parallel Comparison Tree RPCT model is given. The results indicate that while randomization ...