James Aspnes  Home/Search
Context Related
| yale.edu/homes/asp...onsensussurvey.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: yale.edu/homes/aspnes...directory (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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... (Update)
Cited by: More
Optimal Randomized Fair Exchange with Secret Shared Coins - Freiling, Herlihy, Penso (2005) (Correct)
Efficient Low-Contention Asynchronous Consensus with the.. - Aumann, Bender (Correct)
ACM SIGACT News Distributed Computing Column 13 - Sergio Rajsba Um (Correct)
Active bibliography (related documents): More All
1.7: Fast Deterministic Consensus in a Noisy Environment - Aspnes (2000) (Correct)
1.0: Lower Bounds in Distributed Computing - Fich, Ruppert (2000) (Correct)
0.9: Hundreds of Impossibility Results for Distributed Computing - Fich, Ruppert (2003) (Correct)
Similar documents based on text: More All
0.5: Fast Asynchronous Consensus Based on a Weak . . . - Hurfin, Raynal (Correct)
0.4: Lower Bounds for Distributed Coin-Flipping and Randomized Consensus - Aspnes (1998) (Correct)
0.4: Time Cost Analysis of a Consensus Algorithm - Vachon, Schiper (1996) (Correct)
BibTeX entry: (Update)
James Aspnes, \Randomized protocols for asynchronous consensus," Distributed Computing Volume 16, Numbers 2-3, September 2003, pp. 165-175. http://citeseer.ist.psu.edu/aspnes02randomized.html More
@misc{ aspnes03randomized,
author = "J. Aspnes",
title = "Randomized protocols for asynchronous consensus",
text = "James Aspnes, \Randomized protocols for asynchronous consensus, Distributed
Computing Volume 16, Numbers 2-3, September 2003, pp. 165-175.",
year = "2003",
url = "citeseer.ist.psu.edu/aspnes02randomized.html" }
Citations (may not include all citations):1749 An Introduction to Probability Theory and Its Application (context) - Feller - 1970
739 Impossibility of distributed consensus with one faulty proce.. (context) - Fischer, Lynch et al. - 1985
256 Reaching agreements in the presence of faults (context) - Pease, Shostak et al. - 1980
214 Consensus in the presence of partial synchrony - Dwork, Lynch et al. - 1988
186 A methodology for implementing highly concurrent data object.. - Herlihy - 1993
181 ACM Transactions on Programming Languages and Systems (context) - Herlihy - 1991
153 the minimal synchronism needed for distributed consensus (context) - Dolev, Dwork et al. - 1987
97 Asynchronous consensus and broadcast protocols (context) - Bracha, Toueg - 1985
92 Memory requirements for agreement among unreliable asynchron.. (context) - Loui, Abu-Amara - 1987
78 Fast randomized consensus using shared memory - Aspnes, Herlihy - 1990
75 Unreliable failure detectors for reliable distributed system.. - Chandra, Toueg - 1996
73 Randomized Byzantine Generals (context) - Rabin - 1983
61 Software transactional memory - Shavit, Touitou - 1995
57 Randomization in Byzantine agreement (context) - Chor, Dwork - 1989
56 Another advantage of free choice: Completely asynchronous ag.. (context) - Ben-Or - 1983
56 Distributed Computing: Fundamentals (context) - Attiya, Welch - 1998
55 Failure detection and consensus in the crash recovery model - Aguilera, Chen et al. - 2000
55 On achieving consensus using a shared memory (context) - Abrahamson - 1988
46 Faulttolerant wait-free shared objects - Jayanti, Chandra et al. - 1998
45 Failure detectors in omission failure environments - Dolev, Friedman et al. - 1997
38 The weakest failure detector for solving Consensus - Chandra, Hadzilacos et al. - 1996
35 Optimal time randomized consensus|making resilient algorithm.. (context) - Saks, Shavit et al. - 1991
34 Time-lapse snapshots - Dwork, Herlihy et al. - 1999
31 Bounds on the time to reach agreement in the presence of tim.. - Attiya, Dwork et al. - 1994
28 An optimal probabilistic protocol for synchronous Byzantine .. (context) - Feldman, Micali - 1997
26 Bounded polynomial randomized consensus (context) - Attiya, Dolev et al. - 1989
24 Randomized consensus in expected O (context) - Bracha, Rachman - 1991
23 Fast asynchronous Byzantine agreement with optimal resilienc.. (context) - Canetti, Rabin - 1993
22 Randomized consensus in expected O (context) - Aspnes, Waarts - 1996
17 Computing with faulty shared objects - Afek, Greenberg et al. - 1995
13 Wait-free consensus using asynchronous hardware (context) - Chor, Israeli et al. - 1994
12 Robust wait-free hierarchies (context) - Jayanti - 1997
12 The best of both worlds: Guaranteeing termination in fast ra.. - Goldreich, Petrank - 1990
10 Failure detection and randomization: A hybrid approach to so.. - Toueg - 1998
10 Time- and space-ecient randomized consensus (context) - Aspnes - 1993
10 Determining consensus numbers - Ruppert - 1997
8 the improbability of reaching Byzantine agreement (context) - Graham, Yao - 1989
7 Information and Computation (context) - Afek, Merritt et al. - 1999
7 Lower bounds for distributed coin- ipping and randomized con.. (context) - Aspnes - 1998
7 Polylog randomized wait-free consensus (context) - Chandra - 1996
6 Ecient asynchronous consensus with the weak adversary schedu.. (context) - Aumann - 1997
5 Consensus numbers of multi-objects - Ruppert - 1998
5 Approximated counters and randomized consensus (context) - Bracha, Rachman - 1990
4 A randomized Byzantine agreement protocol with constant expe.. (context) - Zamsky - 1996
4 Ecient asynchronous consensus with the value-oblivious adver.. (context) - Aumann, Bender - 1996
3 Time-adaptive algorithms for syncronization (context) - Alur, Attiya et al. - 1997
3 Wait-free syncronization in multiprogrammed systems: Integra.. (context) - Anderson, Moir - 1999
1 the importance of having an identity or is consensus really .. - Buhrman, Panconesi et al. - 2000
1 Sticky bits and universitality of consensus (context) - Plotkin - 1989
1 Fast deterministic consensus in a noisy environment - Aspnes - 2000
1 Consensus numbers of transactional objects - Ruppert - 1999
1 Wait-free consensus with in nite arrivals (context) - Aspnes, Shah et al. - 2002
1 Correctness proof of benor 's randomized consensus algorithm (context) - Aguilera, Toueg - 1998
Documents on the same site (http://www.cs.yale.edu/homes/aspnes/directory.html):
Wait-Free Consensus with Infinite Arrivals - Aspnes, Shah, Shah (2002) (Correct)
Fault-tolerant Routing in Peer-to-peer Systems - Aspnes, Diamadi, Shah (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC