This description was written by a machine and published without a person checking it. It is what the agent made of this grouping, and not a statement anybody has stood behind.
Agreement is bought with assumptions
A subject the papers are about. The loosest grouping, and the one to reach for last.
Whether a set of processes can agree on anything, and what has to be assumed before they can. Collects the consensus results, each a bound with conditions attached, and the impossibility results saying why the conditions cannot all be dropped. Membership requires the assumptions to be the subject: an algorithm that merely achieves agreement belongs elsewhere.
7 references
Byzantine fault tolerance in long-lived systems
Rodrigo Rodrigues and others (2004) · 2nd Bertinoro Workshop on Future Directions in Distributed Computing (FuDiCo II)
Byzantine Failures and Security: Arbitrary is not (always) Random
Felix C. Gärtner (2003) · INFORMATIK 2003 – Mit Sicherheit Informatik, Schwerpunkt "Sicherheit – Schutz und Zuverlässigkeit" · Gesellschaft für Informatik e.V.
Distributed snapshots: determining global states of distributed systems
K. Mani Chandy and others (1985) · ACM Transactions on Computer Systems · Association for Computing Machinery
Impossibility of distributed consensus with one faulty process
Michael J. Fischer and others (1985) · Journal of the ACM · Association for Computing Machinery
The Byzantine Generals Problem
Leslie Lamport and others (1982) · ACM Transactions on Programming Languages and Systems · Association for Computing Machinery
Reaching Agreement in the Presence of Faults
M. Pease and others (1980) · Journal of the ACM · Association for Computing Machinery
Time, clocks, and the ordering of events in a distributed system
Leslie Lamport (1978) · Communications of the ACM · Association for Computing Machinery