The election problem in asynchronous distributed systems with bounded faulty processes
Determining the "weakest" failure detectors is a central topic in solving many agreement problems such as Consensus, Non-Blocking Atomic Commit and Election in asynchronous distributed systems. So far, this has been studied extensively for several such fundamental problems. It is stated that Perfect Failure Detector P is the weakest failure detector to solve the Election problem with any number of faulty processes. In this paper, we introduce Modal failure detector M and show that to solve Election, M is the weakest failure detector to solve election when the number of faulty processes is less than [n/2]. We also show that it is strictly weaker than P.
failure detectors consensus distributed algorithm leader election