1
vote
Where does the FLP impossibility proof depend on allowing a single process failure?
In the PROOF of LEMMA 2:
Now consider some admissible deciding run from $C_0$ in which process p takes no steps, and let u be the associated schedule.
The protocol can become deciding ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
consensus × 63distributed-systems × 41
concurrency × 11
algorithms × 10
byzantine × 7
synchronization × 5
communication-protocols × 4
fault-tolerance × 4
security × 3
blockchain × 3
turing-machines × 1
time-complexity × 1
reference-request × 1
sorting × 1
computer-networks × 1
databases × 1
performance × 1
mutual-exclusion × 1
multi-tasking × 1
computer-games × 1
queues × 1
message-passing × 1
shared-memory × 1
voting × 1