A Probabilistic Pipeline Algorithm for K Selection on the Tree Machine

A.G. Greenberg; U. Manber

doi:10.1109/TC.1987.1676908

Publication
1987
Issue No. 3 - March
Abstract - A Probabilistic Pipeline Algorithm for K Selection on the Tree Machine

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/EndNote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by A.G. Greenberg Articles by U. Manber

A Probabilistic Pipeline Algorithm for K Selection on the Tree Machine

March 1987 (vol. 36 no. 3)

pp. 359-362

	ASCII Text	x
	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.

	BibTex	x
	@article{ 10.1109/TC.1987.1676908, author = {A.G. Greenberg and U. Manber}, title = {A Probabilistic Pipeline Algorithm for K Selection on the Tree Machine}, journal ={IEEE Transactions on Computers}, volume = {36}, number = {3}, issn = {0018-9340}, year = {1987}, pages = {359-362}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1987.1676908}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - JOUR JO - IEEE Transactions on Computers TI - A Probabilistic Pipeline Algorithm for K Selection on the Tree Machine IS - 3 SN - 0018-9340 SP359 EP362 EPD - 359-362 A1 - A.G. Greenberg, A1 - U. Manber, PY - 1987 KW - tree machine KW - Algorithms KW - parallel KW - pipeline KW - selection VL - 36 JA - IEEE Transactions on Computers ER -

A.G. Greenberg, Mathematics and Statistics Research Center, AT&T Bell Laboratories

U. Manber

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.1987.1676908

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.