Key points are not available for this paper at this time.
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.
Hirschberg et al. (Sat,) studied this question.