Decentralized extrema-finding in circular configurations of processors

By D. S. Hirschberg, J. B. Sinclair

Communications of the ACM, Vol. 23 No. 11, Pages 627-628
10.1145/359024.359029

This note presents an efficient algorithm, requiring O(n log n) message passes, for finding the largest (or smallest) of a set of n uniquely numbered processors arranged in a circle, in which no central controller exists and the number of processors is not known a priori.

The full text of this article is premium content

0 Comments

No entries found

Purchase the Article

Decentralized extrema-finding in circular configurations of processors

The full text of this article is premium content

0 Comments

Forgot your password?

Need Access?

Join the ACM

Subscribe to Communications of the ACM Magazine