Simplifying fault-tolerance: Providing the abstraction of crash failures

Journal of the ACM

Volumn 48, Issue 3, 2001, Pages 499-554

  Bazzi, Rida A ^a   Neiger, Gil ^b  

^a ARIZONA STATE UNIVERSITY   (United States)

^b INTEL CORPORATION   (United States)

Author keywords

Crash failures; Fault tolerance; Translations

Indexed keywords

ABSTRACTION; CRASH FAILURES; OMISSION FAILURES; ROUND-COMPLEXITY;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LOGIC DESIGN; PROGRAM PROCESSORS; PROGRAM TRANSLATORS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0141441473     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/382780.382784     Document Type: Article

References (18)

1. ATTIYA, H., DWORK, C., LYNCH, N., AND STOCKMEYER, L. 1994. Bounds on the time to reach agreement in the presence of timing uncertainty. J. ACM 41, 1 (Jan.), 122-152.
2. BAZZI, R. A. 1994. Automatically Increasing Fault Tolerance in Distributed Systems. Ph.D. dissertation. Tech. Rep. 94-62. College of Computing, Georgia Institute of Technology.
3. BAZZI, R. A., AND NEIGER, G. 1992. The complexity and impossibility of achieving fault-tolerant coordination. In Proceedings of the 11th ACM Symposium on Principles of Distributed Computing (Vancouver, B.C., Canada, Aug. 10-12). ACM, New York, pp. 203-214.
4. BRACHA, G. 1987. Asynchronous Byzantine agreement protocols. Inf. Comput. 75, 2 (Nov.), 130-143.
5. COAN, B. A. 1986. A communication-efficient canonical form for fault-tolerant distributed protocols. In Proceedings of the 5th ACM Symposium on Principles of Distributed Computing (Calgary, Alta., Canada, Aug. 11-13). ACM, New York, pp. 63-72. (A revised version appears in Coan's Ph.D. dissertation [Coan 1987].)
6. COAN, B. A. 1987. Achieving Consensus in Fault-Tolerant Distributed Computer Systems: Protocols, Lower Bounds, and Simulations. Ph.D. dissertation. Massachusetts Institute of Technology, Cambridge, Mass.
7. COAN, B. A. 1988. A compiler that increases the fault-tolerance of asynchronous protocols. IEEE Trans. Comput. 37, 12 (Dec.), 1541-1553.
8. FISCHER, M. J., AND LYNCH, N. A. 1982. A lower bound for the time to assure interactive consistency. Inf. Process. Lett. 14, 183-186.
9. GARAY, J. A., AND MOSES, Y. 1998. Fully polynomial Byzantine agreement for n > 3t processors in t + 1 rounds. SIAM J. Comput. 27, 1 (Feb.), 247-290.
10. HADZILACOS, V. 1983. Byzantine agreement under restricted types of failures (not telling the truth is different from telling lies). Tech. Rep. 18-83, Aiken Computation Laboratory, Harvard University. (A revised version appears in Hadzilacos's Ph.D. dissertation [Hadzilacos 1984].)
11. HADZILACOS, V. 1984. Issues of fault tolerance in concurrent computations. Ph.D. dissertation. Harvard Univ.
12. HALPERN, J. Y., AND MOSES, Y. 1990. Knowledge and common knowledge in a distributed environment. J. ACM 37, 3 (July), 549-587.
13. LAMPORT, L., SHOSTAK, R., AND PEASE, M. 1982. The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4, 3 (July), 382-401.
14. NEIGER, G., AND TOUEG, S. 1990. Automatically increasing the fault-tolerance of distributed algorithms. J. Algorithms 11, 3 (Sept.), 374-419.
15. NEIGER, G., AND TUTTLE, M. R. 1993. Common knowledge and consistent simultaneous coordination. Distr. Comput. 6, 3 (Apr.), 181-192.
16. PERRY, K. J., AND TOUEG, S. 1986. Distributed agreement in the presence of processor and communication faults. IEEE Trans. Softw. Eng. 12, 3 (Mar.), 477-482.
17. PONZIO, S. 1991. Consensus in the presence of timing uncertainty: Omission and Byzantine failures. In Proceedings of the 10th ACM Symposium on Principles of Distributed Computing (Montreal, Que., Canada, Aug. 19-21). ACM, New York, pp. 125-138.
18. SRIKANTH, T. K., AND TOUEG, S. 1987, Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distr. Comput. 2, 2, 80-94.