The weakest failure detector for solving consensus

Journal of the ACM

Volumn 43, Issue 4, 1996, Pages 685-722

  Chandra, Tushar Deepak ^a   Hadzilacos, Vassos ^b   Toueg, Sam ^c,d  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

^c Department of Obstetrics Gynecology   (United States)

^d Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Agreement problem; Algorithms; Asynchronous systems; Atomic broadcast; Byzantine Generals' problem; Commit problem; Consensus problem; Crash failures; Failure detection; Fault tolerance; Message passing; Partial synchrony; Processor failures; Reliability; Theory

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTER NETWORKS; COMPUTER OPERATING SYSTEMS; DATA COMMUNICATION SYSTEMS; DATABASE SYSTEMS; ERROR DETECTION; FAULT TOLERANT COMPUTER SYSTEMS; RELIABILITY;

AGREEMENT PROBLEM; ASYNCHRONOUS SYSTEMS; ATOMIC BROADCAST; BYZANTINE GENERALS PROBLEM; COMMIT PROBLEM; CONSENSUS PROBLEM; CRASH FAILURES; FAILURE DETECTION; PARTIAL SYNCHRONY; PROCESSOR FAILURES;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0030197368     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/234533.234549     Document Type: Article

References (10)

1. ATTIYA, H., BAR-NOY, A., DOLEV, D., KOLLER, D., PELEG, D., AND REISCHUK R. 1987. Achievable cases in an asynchronous environment. In Proceedings of the 28th Symposium on Foundations of Computer Science. IEEE Computer Society Press, New York, pp. 337-346.
2. BIRAN, O., MORAN, S., AND ZAKS, S. 1988. A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor. In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing (Toronto, Ont., Canada, Aug. 15-17). ACM, New York, pp. 263-275.
3. BRIDGLAND, M. F., AND WATRO, R. J. 1987. Fault-tolerant decision making in totally asynchronous distributed systems. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing (Vancouver, B.C., Canada, Aug. 10-12). ACM, New York, pp. 52-63.
4. CHANDRA, T. D., AND TOUEG, S. 1996. Unreliable failure detectors for reliable distributal systems. J. ACM 43, 2 (Mar.), 225-267.
5. CHOR, B., AND DWORK, C. 1989. Randomization in byzantine agreement. Adv. Comput. Res. 5, 443-497.
6. DOLEV, D., DWORK, D., AND STOCKMEYER, L. 1987. On the minimal synchronism needed for distributed consensus. J. ACM 34, 1 (Jan.), 77-97.
7. DOLEV, D., LYNCH, N. A., PINTER, S. S., STARK, E. W., AND WEIHL, W. E. 1986. Reaching approximate agreement in the presence of faults. J. ACM 33, 3 (July), 499-516.
8. DWORK, C., LYNCH, N. A., AND STOCKMEYER, L. 1988. Consensus in the presence of partial synchrony. J. ACM 35, 2 (Apr.), 288-323.
9. FISCHER, M. J., LYNCH, N. A., AND PATERSON, M. S. 1985. Impossibility of distributed consensus with one faulty process. J. ACM 32, 2 (Apr.), 374-382.
10. RICCIARDI, A. M., AND BIRMAN, K. P. 1991. Using process groups to implement failure detection in asynchronous environments. In Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing (Montreal, Que., Canada, Aug. 19-21). ACM, New York, pp. 341-351.