Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
On implementing omega with weak reliability and synchrony assumptions
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Implementing unreliable failure detectors with unknown membership
Information Processing Letters
Crash-quiescent failure detection
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Eventually perfect failure detectors using ADD channels
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Hi-index | 0.89 |
The failure detector class Omega (@W) provides an eventual leader election functionality, i.e., eventually all correct processes permanently trust the same correct process. An algorithm is communication-efficient if the number of links that carry messages forever is bounded by n, being n the number of processes in the system. It has been defined that an algorithm is crash-quiescent if it eventually stops sending messages to crashed processes. In this regard, it has been recently shown the impossibility of implementing @W crash quiescently without a majority of correct processes. We say that the membership is unknown if each process p"i only knows its own identity and the number of processes in the system (that is, i and n), but p"i does not know the identity of the rest of processes of the system. There is a type of link (denoted by ADD link) in which a bounded (but unknown) number of consecutive messages can be delayed or lost. In this work we present the first implementation (to our knowledge) of @W in partially synchronous systems with ADD links and with unknown membership. Furthermore, it is the first implementation of @W that combines two very interesting properties: communication-efficiency and crash-quiescence when the majority of processes are correct. Finally, we also obtain with the same algorithm a failure detector (@?P@?) such that every correct process eventually and permanently outputs the set of all correct processes.