The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (1987 vol.36)
pp: 359-362
A.G. Greenberg , Mathematics and Statistics Research Center, AT&T Bell Laboratories
ABSTRACT
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
INDEX TERMS
tree machine, Algorithms, parallel, pipeline, selection
CITATION
A.G. Greenberg, U. Manber, "A Probabilistic Pipeline Algorithm for K Selection on the Tree Machine", IEEE Transactions on Computers, vol.36, no. 3, pp. 359-362, March 1987, doi:10.1109/TC.1987.1676908
26 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool