Rate this article:     (best)
very useful This material was really very useful thank you View Comments (2)
|
(Enter summary)
Abstract: equivalent in asynchronous
systems. Thus all our results regarding the solvability of Consensus using
failure detectors, apply to Atomic Broadcast as well.
The work in this thesis was funded by an IBM graduate fellowship and grants
from NSF, DARPA/NASA, the IBM Endicott Programming Laboratory, Siemens
Corp and the Natural Siences and Engineering Research Council of Canada.
Biographical Sketch
Tushar Deepak Chandra was born in New Delhi, India on November 13, 1966. He
spent his childhood in... (Update)
Context of citations to this paper: More
...data is combined with high fault tolerance. Related work. The consensus algorithms of Dwork et al. 5] and of Chandra and Toueg [2] bear some similarities with paxos. The algorithm of [5] also uses rounds conducted by a leader, but the rounds are conducted sequentially,...
...be solvable. This clearly implies that in a completely asynchronous setting no reliable failure detector can be provided. Chandra and Toueg [5] gave a definition of unreliable failure detector, and characterized failure detectors in terms of two properties: completeness, which...
Cited by: More
Dynamic and Adaptive Replication for Large-Scale.. - Guessoum, Briot.. (2002)
(Correct)
Fundamental Study Revisiting the PAXOS algorithm - De Prisco, Lampson, Lynch (2000)
(Correct)
Revisiting the Paxos Algorithm - De Prisco (1998)
(Correct)
Similar documents (at the sentence level):
29.1%: The Weakest Failure Detector for Solving Consensus - Chandra, Hadzilacos, Toueg (1996)
(Correct)
17.6%: Unreliable Failure Detectors for Reliable Distributed Systems - Chandra, Toueg (1995)
(Correct)
Active bibliography (related documents): More All
0.6: A Modular Approach to Fault-Tolerant Broadcasts and Related.. - Hadzilacos, Toueg (1994)
(Correct)
0.2: Practical Impact of Group Communication Theory - Schiper (2003)
(Correct)
0.2: Hundreds of Impossibility Results for Distributed Computing - Fich, Ruppert (2003)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.9: Eventually Consistent Failure Detectors - Larrea, Fernández.. (2000)
(Correct)
0.8: Optimal Implementation of the Weakest Failure.. - Larrea..
(Correct)
0.7: Brief Announcement: Optimal Implementation of the.. - Larrea..
(Correct)
Related documents from co-citation: More All
3: Distributed Algorithms (context) - Lynch - 1996
3: Consensus in the presence of partial synchrony
- Dwork, Lynch et al. - 1988
3: The consensus problem in unreliable distributed systems
- Fischer - 1983
BibTeX entry: (Update)
T.D. Chandra, S. Toueg, Unreliable failure detector for asynchronous distributed systems, Journal of the ACM, Vol. 43 (2), pp. 225--267. A preliminary version appeared in the Proceedings of the 10 th Annual ACM Symposium on Principles of Distributed Computing, pages 325--340, August 1991. http://citeseer.ist.psu.edu/article/chandra93unreliable.html More
@techreport{ chandra93unreliable,
author = "Tushar Deepak Chandra",
title = "Unreliable Failure Detectors for Asynchronous Distributed Systems",
number = "TR93-1377",
pages = "120",
year = "1993",
url = "citeseer.ist.psu.edu/article/chandra93unreliable.html" }
Citations (may not include all citations):
739
Impossibility of distributed consensus with one faulty proce.. (context) - Fischer, Lynch et al. - 1985
361
Reliable communication in the presence of failures (context) - Birman, Joseph - 1987
310
Transis: A communication sub-system for high availability
- Amir, Dolev et al. - 1991
264
Knowledge and common knowledge in a distributed environment
- Halpern, Moses - 1990
256
Reaching agreement in the presence of faults (context) - Pease, Shostak et al. - 1980
214
Consensus in the presence of partial synchrony
- Dwork, Lynch et al. - 1988
214
Preserving and using context information in interprocess com..
- Peterson, Bucholz et al. - 1989
153
the minimal synchronism needed for distributed consensus (context) - Dolev, Dwork et al. - 1987
141
Using process groups to implement failure detection in async.. (context) - Ricciardi, Birman - 1991
138
Delta-4: A Generic Architecture for Dependable Distributed C.. (context) - Powell - 1991
125
ACM Transactions on Computer Systems (context) - Chang, Maxemchuk et al. - 1984
120
ACM Transactions on Programming Languages and Systems (context) - Lamport, Shostak et al. - 1982
92
Memory requirements for agreement among unreliable asynchron.. (context) - Loui - 1987
89
Implementing fault-tolerant services using the state machine.. (context) - Schneider - 1990
88
SIFT: Design and analysis of a fault-tolerant computer for a.. (context) - Wensley, Lamport et al. - 1978
77
Reaching approximate agreement in the presence of faults
- Dolev, Lynch et al. - 1986
70
The consensus problem in unreliable distributed systems
- Fischer - 1983
62
Fault-tolerance in the advanced automation system (context) - Cristian, Dancey et al. - 1990
57
Randomization in byzantine agreement (context) - Chor, Dwork - 1989
39
The implementation of reliable distributed multiprocess syst.. (context) - Lamport - 1978
36
Achievable cases in an asynchronous environment (context) - Attiya, Bar-Noy et al. - 1987
33
Byzantine generals and transaction commit protocols
- Lamport, Fischer - 1982
32
Issues of Fault Tolerance in Concurrent Computations (context) - Hadzilacos - 1984
31
Bounds on the time to reach agreement in the presence of tim..
- Attiya, Dwork et al. - 1991
29
Distributed agreement in the presence of processor and commu.. (context) - Perry, Toueg - 1986
26
Towards optimal distributed consensus (context) - Berman, Garay et al. - 1989
21
Reliable scheduling in a tmr database system (context) - Pittelli, Garcia-Molina - 1989
20
Cheating husbands and other stories: a case study of knowled.. (context) - Moses, Dolev et al. - 1986
20
ISIS - A Distributed Programming Environment (context) - Birman, Cooper et al. - 1990
17
Fault-tolerant decision making in totally asynchronous distr.. (context) - Bridgland, Watro - 1987
15
Earlydelivery atomic broadcast (context) - Gopal, Strong et al. - 1990
15
A combinatorial characterization of the distributed tasks th.. (context) - Biran, Moran et al. - 1988
14
Methods for distributed transaction commit and recovery usin.. (context) - Mohan, Strong et al. - 1987
9
Issues in the design of highly available computing services (context) - Cristian - 1987
7
Using failure detectors to solve consensus in asynchronous s.. (context) - Lo - 1993
6
Early-stopping distributed bidding and applications (context) - Budhiraja, Gopal et al. - 1990
4
A new solution for the Byzantine general's problem (context) - Reischuk - 1982
1
Time and message efficient reliable broadcasts (context) - Chandra, Toueg - 1990
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.toronto.edu.html): More
Exploiting Cache Affinity in Software Cache Coherence - Li, Sevcik (1994)
(Correct)
A New Approach to Tracking 3D Objects in 2D Image Sequences - Chan, Metaxas, Dickinson (1994)
(Correct)
GraphLog: a Visual Formalism for Real Life Recursion - Consens (1990)
(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