Leader election in the presence of n−1 initial failures
Gadi Taubenfeld · Information Processing Letters · 1989
We present a deterministic leader election protocol that can tolerate up to n−1 undetectable initial failures, where n is the number of processes. We assume an asynchronous shared memory model that supports only single writer and multi readers regular registers