A probabilistic algorithm is presented for sorting real numbers that allows a significant speed-up even under restricted parallelism. The machine model used consists of a random access machine to which 3 coprocessors...
详细信息
A probabilistic algorithm is presented for sorting real numbers that allows a significant speed-up even under restricted parallelism. The machine model used consists of a random access machine to which 3 coprocessors are attached. The first 2 processors -- DISTRIBUTE and SORT -- are linear systolic arrays containing p processing elements. The 3rd coprocessor, RANDOM, produces a random number x between zero and one. The model is a sequential random access machine and is only augmented by some special purpose processors. The range for an improvement against sequential O(n log n) algorithms for sorting is somewhat small. The main open issue that remains is whether the time bound of Algorithm Sort can be obtained by any deterministic algorithm or can be proved impossible by giving lower bounds.
作者:
REISCHUK, RUniv Bielefeld
Fakultaet fuer Mathematik Bielefeld West Ger Univ Bielefeld Fakultaet fuer Mathematik Bielefeld West Ger
probabilistic parallel algorithms are described to sort n keys and to select the k-smallest element among them. For each problem we construct a probabilistic parallel decision tree. The tree for selection finishes wit...
详细信息
probabilistic parallel algorithms are described to sort n keys and to select the k-smallest element among them. For each problem we construct a probabilistic parallel decision tree. The tree for selection finishes with high probability in constant time and the sorting tree in time O(logn)
暂无评论