Leader election in asynchronous distributed systems with unreliable failure detectors

This paper is about the Election problem in asynchronous distributed systems with failure detectors. We first discuss the relationship between the Election problem and the Consensus problem in asynchronous distributed systems with unreliable failure detectors. It is stated in [7] that a Perfect Failure Detector is needed to solve the Election problem. But in contrast to the result, there is a failure detector that solves Election weaker than the Perfect Failure Detector We introduce the Leader Perfect failure detector LP We show that to solve Election, LP is necessary while P is not, whereas LP+ lozengeS is sufficient when a majority of the processes are correct.