Chang and Roberts algorithm
Chang and Roberts[1] is a ring-based election algorithm used to find the process with the largest identification. It is a useful method of election in decentralised distributive computing.
The algorithm
The algorithm assumes that each process has a Universal Identification (UID) and that the process can arrange themselfs in an unidirectional ring.
References
- ^ "An improved algorithm for decentralized extrema-finding in circular configurations of processes", Communications of the ACM, 22 (5), ACM: 281–283, 1979
{{citation}}: Unknown parameter|authors=ignored (help)