Coordinator selection in distributed systems: Cellular automata model based approach

This paper reports a scheme that selects a process as a coordinator from a set of n processes of a distributed system. The scheme demands only O(n) messages in worst case to select a leader. In the proposed scheme, each process maintains a partial view of the global state of the system, and that view enables the system to select a coordinator in an efficient way.