Abstract
We determine the weakest failure detector to solve nonuniform consensus in any environment, i.e., regardless of the number of faulty processes. Together with previous results, this closes all aspects of the following question: What is the weakest failure detector to solve (uniform or nonuniform) consensus in any environment?
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Chandra T.D., Hadzilacos V. and Toueg S. (1996). The weakest failure detector for solving consensus. JACM 43(4): 685–722
Chandra T.D. and Toueg S. (1996). Unreliable failure detectors for reliable distributed systems. JACM 43(2): 225–267
Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: Shared memory vs. message passing. Technical Report IC/2003/77, EPFL (2003)
Fischer M.J., Lynch N.A. and Paterson M.S. (1985). Impossibility of distributed consensus with one faulty process. JACM 32(2): 374–382
Lamport L. (1978). Time, clocks and the ordering of events in a distributed system. CACM 21(7): 558–565
Mostéfaoui A. and Raynal M. (2001). Leader-based consensus. Parall Process. Lett. 11(1): 95–107
Author information
Authors and Affiliations
Additional information
Research supported in part by the Natural Sciences and Engineering Council of Canada.
Rights and permissions
About this article
Cite this article
Eisler, J., Hadzilacos, V. & Toueg, S. The weakest failure detector to solve nonuniform consensus. Distrib. Comput. 19, 335–359 (2007). https://doi.org/10.1007/s00446-006-0019-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00446-006-0019-4