Election in a Ring (Chang and Roberts Algorithm)
Consider an unidirectional ring of n processors, each with a unique identity. We assume that the set of identities is totally ordered. Each node maintains a variable to keep the largest node identity it has seen. Initially, each node with identity id is labelled (id, id).
