The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Hi-index | 0.00 |
The election of an eventual leader in an asynchronous system prone to process crashes is an important problem of fault-tolerant distributed computing. This problem is known as the implementation of the failure detector Ω. In this work we propose a specification of Ω suited to dynamic systems, i.e., systems in which processes can enter and leave.