ACM

Communications of the ACM

Home/Magazine Archive/May 1979 (Vol. 22, No. 5)/An improved algorithm for decentralized extrema-finding.../Abstract

An improved algorithm for decentralized extrema-finding in circular configurations of processes

By Ernest Chang, Rosemary Roberts
Communications of the ACM, May 1979, Vol. 22 No. 5, Pages 281-283
10.1145/359104.359108
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

This note presents an improvement to LeLann's algorithm for finding the largest (or smallest) of a set of uniquely numbered processes arranged in a circle, in which no central controller exists and the number of processes is not known a priori. This decentralized algorithm uses a technique of selective message extinction in order to achieve an average number of message passes of order (n log n) rather than O(n2).

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.