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…