Randomized protocols for asynchronous consensus
| dc.creator | Aspnes, James | |
| dc.date | 2002-09-06 | |
| dc.date.accessioned | 2026-07-07T03:18:52Z | |
| dc.date.available | 2026-07-07T03:18:52Z | |
| dc.description | The famous Fischer, Lynch, and Paterson impossibility proof shows that it is impossible to solve the consensus problem in a natural model of an asynchronous distributed system if even a single process can fail. Since its publication, two decades of work on fault-tolerant asynchronous consensus algorithms have evaded this impossibility result by using extended models that provide (a) randomization, (b) additional timing assumptions, (c) failure detectors, or (d) stronger synchronization mechanisms than are available in the basic model. Concentrating on the first of these approaches, we illustrate the history and structure of randomized asynchronous consensus protocols by giving detailed descriptions of several such protocols. | |
| dc.description | 29 pages; survey paper written for PODC 20th anniversary issue of Distributed Computing | |
| dc.identifier | https://arxiv.org/abs/cs/0209014 | |
| dc.identifier | http://arxiv.org/abs/cs/0209014 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31291 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.subject | F.2.2; F.1.2 | |
| dc.title | Randomized protocols for asynchronous consensus | |
| dc.type | text |