Stopping times of distributed consensus protocols: a probabilistic analysis (Q1089784)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1089784 |
scientific article; zbMATH DE number 4005587
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stopping times of distributed consensus protocols: a probabilistic analysis |
scientific article; zbMATH DE number 4005587 |
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
0.823689877986908
0 references
0.7873467803001404
0 references
0.7813407778739929
0 references
0.780674397945404
0 references
0.7803161144256592
0 references
