3047 search results - page 1 / 610 » Randomized Parallel Selection |
IPPS
1996
IEEE
13 years 9 months ago
1996
IEEE
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...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
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 ...
FSTTCS
1990
Springer
13 years 9 months ago
1990
Springer
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...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
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 ...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
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 ...