Issue No. 03 - March (1987 vol. 36)
A.G. Greenberg , Mathematics and Statistics Research Center, AT&T Bell Laboratories
We consider the problem of selecting the kth largest of n inputs, where initially the inputs are stored in the n leaf processors of the 2n - 1 processor tree machine. A probabilistic algorithm is presented that implements a type of pipelining to solve the problem in a simple data driven fashion, with each processor maintaining just a constant amount of state information. On any problem instance, t
tree machine, Algorithms, parallel, pipeline, selection
A. Greenberg and U. Manber, "A Probabilistic Pipeline Algorithm for K Selection on the Tree Machine," in IEEE Transactions on Computers, vol. 36, no. , pp. 359-362, 1987.