Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Hirschberg et al. (1980) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: