An Improved Algorithm for Decentralized Extrema-Finding in Circular Configurations of Processes 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). CACM May, 1979 Chang, E. Roberts, R. Decentralized algorithms, distributed systems, operating systems 4.32 4.35 5.25 5.32 CA790502 DH June 5, 1979 2:35 PM 3141 5 3141 3141 5 3141 3141 5 3141