Stopping times of distributed consensus protocols: a probabilistic analysis (Q1089784)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stopping times of distributed consensus protocols: a probabilistic analysis |
scientific article |
Statements
Stopping times of distributed consensus protocols: a probabilistic analysis (English)
0 references
1987
0 references
Given a model where each processor remains correct for an exponentially distributed random time and then fails independently of the others, we characterize system executions that permit the processors to reach consensus. We show that, with nonzero probability, a protocol can achieve consensus even during executions where the number of actual processors to fail exceeds its resiliency.
0 references
Byzantine agreement
0 references
resiliency
0 references
reliable computing
0 references
probabilistic failure
0 references
distributed computing system
0 references
system executions
0 references
processors
0 references
