So far, the weakest failure detectors had been studied extensively for several of 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 . We also show that it is strictly weaker than P.
展开▼
