Closure and Convergence: A Foundation of Fault-Tolerant Computing

IEEE Transactions on Software Engineering

Volumn 19, Issue 11, 1993, Pages 1015-1027

  Arora, Anish ^a   Gouda, Mohamed ^b  

^a OHIO STATE UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Algorithms; closure; convergence; design; faulttolerance; masking; reliability; stabilizing; verification

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; CONVERGENCE OF NUMERICAL METHODS; DIGITAL COMPUTERS; FAILURE ANALYSIS; FAULT TOLERANT COMPUTING; INVARIANCE; RELIABILITY; STABILIZATION; STATE ESTIMATION; SYSTEMS ANALYSIS;

CLOSURE; CONVERGENCE; FAULT TOLERANCE; VERIFICATION;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0027699702     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.256850     Document Type: Article

References (41)

1. T. Anderson and P. Lee, “Fault tolerance terminology proposals,” in Proc. FTCS-12, 1982, pp. 29–33.
2. A. Arora, “A foundation of fault-tolerant computing,” Ph.D. dissertation. The University of Texas, Austin, 1992.
3. A. Arora and M. Gouda, “Closure and convergence: A formulation of fault-tolerant computing,” in Proc. 22nd Int. Symp. Fault-Tolerant Computing, 1992, pp. 396–403.
4. A. Arora and M. Gouda, “Distributed reset,” to be published in IEEE Trans. Comput.; in Proc. 10th Conf. Foundations Software Technol. Theoretical Comput. Sci., Lecture Notes in Comput. Sci. 472, (New York: Springer-Verlag), 1990, pp. 316–331.
5. A. Arora, M. Gouda, and G. Varghese, “Distributed constraint satisfaction,” Int. Conf Distributed Comput. Syst., 1994, submitted for publication.
6. A. Avizienis, “The four-universe information system model for the study of fault tolerance,” in Proc. 12th Int. Symp. Fault-Tolerant Computing, 1982, pp. 6–13.
7. F. Bastani, I.-L. Yen, and I. Chen, “A class of inherently fault-tolerant distributed programs,” IEEE Trans. Softweare Eng., vol. 14, no. 10, pp. 1431–1442, 1988.
8. P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Reading, MA: Addison-Wesley, 1987.
9. G. Brown, and Y. Afek, “Self-stabilization of the Alternating-Bit protocol,” in Proc. 8th Symp. Reliable Distrib. Syst., 1989, pp. 80–83.
10. M. Breuer and A. Friedman, Diagnosis and Reliable Design of Digital Systems. Computer Science Press, 1976.
11. J. Burns and J. Pachl, “Uniform stabilizing rings,” ACM Trans. Programming Languages Syst., vol. 11, no. 2, pp. 330–344, 1989.
12. K. Chandy and J. Misra, Parallel Program Design: A Foundation. Reading, MA: Addison-Wesley, 1988.
13. F. Cristian, “Understanding fault-tolerant distributed systems,” Commun. ACM, vol. 34, 2, no. pp. 56–78, 1991.
14. F. Cristian, “A rigorous approach to fault-tolerant programming,” IEEE Trans. Software Eng., vol. SE-11, no. 1, 1985.
15. E. Dijkstra, “Self-stabilizing systems in spite of distributed control,” Commun. ACM, vol. 17, no. 11, 1974.
16. E. Dijkstra, A Discipline of Programming. New York: Prentice-Hall, 1976.
17. E. Dijkstra, “Solution of a problem in concurrent programming control,” Commun. ACM, vol. 17, no. 11, p. 569, 1965.
18. E. Dijkstra and C. Scholten, Predicate Calculus and Program Semantics. New York: Springer-Verlag, 1990.
19. P. Ezhilchelvan and S. Shrivastava, “A characterization of faults in systems,” in Proc. 5th Symp. Reliability Distrib. Software Database Syst., 1986.
20. M. Fischer, N. Lynch, and M. Paterson, “Impossibility of distributed consensus with one faulty process,” J. ACM, vol. 32, no. 2, pp. 374—382, 1985.
21. M. Gouda, and N. Multari, “Stabilizing communication protocols,” IEEE Trans. Comput., vol. 40, no. 4, pp. 448–458, 1991.
22. D. Gries, The Science of Programming. New York: Springer-Verlag, 1981.
23. B. Johnson, The Design and Analysis of Fault-Tolerant Digital Systems. Reading, MA: Addison-Wesley, 1989.
24. S. Katz and K. Perry, “Self-stabilizing extensions for message-passing systems,” in Proc. 9th ACM Symp. Principles Distrib. Computing, 1990, pp. 91–101.
25. L. Lamport, “Solved problems, unsolved problems and non-problems in concurrency,” Invited talk, in Proc. 3rd Ann. ACM Symp. Principles Distrib. Computing, 1984, pp. 1–11.
26. B. Lampson and H. Sturgis, “Crash recovery in a distributed storage system,” Tech. Rep., Xerox Palo Alto Research Center, Palo Alto, CA, 1979.
27. J.-C. Laprie, “Dependable computing and fault tolerance: Concepts and terminology,” in Proc. 15th Int. Symp. Fault-Tolerant Computing, 1985, pp. 2–11.
28. N. Lynch, “A hundred impossibility proofs for distributed computing,” Invited talk, in Proc. 8th Ann. ACM Symp. Principles Distrib. Computing, 1989, pp. 1–29.
29. A. Mili, An Introduction to Program Fault-Tolerance. New York: Prentice-Hall, 1990.
30. C. Mohan, R. Strong, and S. Finkelstein, “Methods for distributed transaction commit and recovery using byzantine agreement within clusters of processes,” in Proc. 2nd ACM Symp. Principles Distrib. Computing, 1983, pp. 29–43.
31. J. von Neumann, “Probabilistic logics and the synthesis of reliable organisms from unreliable components,” in Automata Studies. Princeton University Press, 1956, pp. 43–98.
32. R. Schlichting and F. Schneider, “Fail-stop processors: An approach to designing fault-tolerant computing systems,” ACM Trans. Comput., pp. 222–238, 1983.
33. M. Schneider, “Self-Stabilization,” ACM Comput. Surveys, vol. 25, no. 1, pp. 45–67, 1993.
34. C. Seitz, “System timing,” in Introduction to VLSI Systems. Addison-Wesley, 1980.
35. D. Siewiorek, “Architecture of fault-tolerant computers,” in Fault-Tolerant Computing (vol. II). New York: Prentice-Hall, 1986.
36. D. Skeen and M. Stonebraker, “A formal model of crash recovery in a distributed system,” IEEE Trans. Software Eng., pp. 219–228, 1983.
37. T. Srikanth and S. Toeug, “Simulating authenticated broadcast to derive simple fault tolerant algorithms,” Distrib. Computing, vol. 2, no. 2, pp. 80–94, 1987.
38. B. Randell, “System structure for software fault tolerance,” IEEE Trans. Software Eng., pp. 220–232, 1975.
39. A. Tanenbaum, Computer Networks. New York: Prentice-Hall, 1981.
40. I.-L. Yen, F. Bastani, and E. Leiss, “An inherently fault-tolerant sorting algorithm,” in Proc. 5th Int. Parallel Process. Symp., 1991, pp. 37–42.
41. Y. Zhao and F. Bastani, “A self-adjusting algorithm for byzantine agreement,” Distributed. Comput., vol. 5, pp. 219–226, 1992.