Decentralized extrema-finding in circular configurations of processors

1 November 1980

journal article
Published by Association for Computing Machinery (ACM) in Communications of the ACM

Vol. 23 (11) , 627-628
https://doi.org/10.1145/359024.359029

Abstract

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.

Keywords

DECENTRALIZED ALGORITHMS
OPERATING SYSTEMS
CIRCULAR CONFIGURATION
DECENTRALIZED EXTREMA-FINDING
DISTRIBUTED SYSTEM
CENTRAL CONTROLLER
N LOG N
EFFICIENT ALGORITHM
MESSAGE PASSING

This publication has 1 reference indexed in Scilit:

An improved algorithm for decentralized extrema-finding in circular configurations of processes
Communications of the ACM, 1979