Unified Approach to Synchronous & Asynchronous Approximate Agreement in the Presence of Hybrid Faults

IEEE Transactions on Reliability

Volumn 44, Issue 4, 1995, Pages 622-631

  Kieckhafer, R M ^a   Azadmanesh, M H ^b  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

^b UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

Author keywords

Approximate agreement; Byzantine agreement; Clock synchronization; Convergent voting algorithm; Fault tolerant multiprocessor; Hybrid fault

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; FAULT TOLERANT COMPUTER SYSTEMS; OPTIMIZATION;

ASYNCHRONOUS APPROXIMATE AGREEMENT; BYZANTINE AGREEMENT; CLOCK SYNCHRONIZATION; CONVERGENT VOTING ALGORITHM; HYBRID FAULTS; SYNCHRONOUS APPROXIMATE AGREEMENT;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0029519169     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/24.475992     Document Type: Article

References (32)

1. K.W. Anderson, D.W. Hall, Sets, Sequences, and Mappings: The Basic Concepts of Analysis, 1963; John Wiley & Sons.
2. M.H. Azadmanesh, R.M. Kieckhafer, “Asynchronous approximate agreement with mixed-mode faults”, Technical Report Series, No. 93–19, 1993 Jun; Univ. of Nebraska, Dept. Comp. Sci. & Eng.
3. M.H. Azadmanesh, R.M. Kieckhafer, “Asynchronous approximate agreement in partially connected systems”, J. Computing & Information, (to appear).
4. M.H. Azadmanesh, “Reaching approximate agreement with multiple fault-modes”, PhD Dissertation, 1993 Aug; University of Nebraska - Lincoln, Dept Comp. Sci. & Eng.
5. L. Chen, A. Avizienis, “N-version programming: A fault tolerant approach to reliability of software operation”, Proc. Int'l Symp. Fault Tolerant Computing, 1978, pp 3–9.
6. B. A. Coan, “A compiler that increases the fault-tolerance of asynchronous protocols”, IEEE Trans. Computers, vol 37, 1988 Dec, pp 1541–1553.
7. E.W. Czeck, et al, “Fault free performance validation of a fault-tolerant multiprocessor: Baseline and synthetic workload measurements”, Technical Report CMU-CS-85-117; Carnegie Mellon University, Dept. Computer Science.
8. D. Dolev, N.A. Lynch, S.S. Pinter, et al, “Reaching approximate agreement in the presence of faults”, Proc. Third Symp. Reliability in Distributed Software & Database Systems, 1983 Oct.
9. D. Dolev, N.A. Lynch, S.S. Pinter, et al, “Approximate agreement in the presence of faults”, J. ACM, vol 33, 1986 Jul, pp 499–516.
10. M.M. Hugue, “Static reliability modeling with the hybrid fault model”, Proc. ONR Workshop, Ultra-Dependable Multi-Computers and Electronic Systems, 1991 Nov, pp 23–28.
11. J.L.W. Kessels, “Two designs of a fault-tolerant clocking system”, IEEE Trans. Computers, vol C-33, 1984 Oct, pp 912–919.
12. G. Kane, J. Heinrich, MIPS RISC Architecture, 1992; Prentice Hall.
13. R.M. Kieckhafer, C.J. Walter, A.M. Finn, P.M. Thambidurai, “The MAFT architecture for distributed fault-tolerance”, IEEE Trans. Computers, vol 37, 1988 Apr, pp 398–405.
14. R.M. Kieckhafer, M.H. Azadmanesh, “Fault-tolerant convergent voting in large sparsely connected networks”, Proc. Complex System Engineering, Synthesis, and Assessment Tech. Workshop (CSESAW), 1992 Jul, pp 31–51.
15. R.M. Kieckhafer, M.H. Azadmanesh, “Low cost approximate agreement in partially connected networks”, J. Computing & Information, vol 3, num 2, 1993, pp 53–85.
16. R.M. Kieckhafer, M.H. Azadmanesh, “Reaching approximate agreement with mixed mode faults”, IEEE Trans. Parallel & Distributed Systems, vol 5, 1994 Jan, pp 53–63.
17. C.M. Krishna, K.G. Shin, R.W. Butler, “Ensuring fault tolerance of phase-locked clocks”, IEEE Trans. Computers, vol C-34, No. 8, pp 752–756, Aug 1985.
18. L. Lamport, P.M. Melliar-Smith, “Synchronizing clocks in the presence of faults”, J. ACM, vol 32, No. 1, pp 52–78, Jan 1985.
19. P. Lincoln, J. Rushby, “A formally verified algorithm for interactive consistency under a hybrid fault model”, Proc. 23rd Fault-Tolerant Computing Symp, 1993 Jun, pp 402–411.
20. P. Lincoln, J. Rushby, “Formal verification of an algorithm for interactive consistency under a hybrid fault model”, Proc. Computer Aided Verification (CAV-93), reprinted in Springer-Verlag Lec. Notes in Computer Science, vol 697, (C. Courcoubetis, Ed), 1993 Jul, pp 292–304.
21. C.L. Liu, Elements of Discrete Mathematics (2nd ed), 1985; McGraw-Hill.
22. J. Lundelius, N. Lynch, “A new fault-tolerant algorithm for clock synchronization”, Third Symp. Principles of Distributed Computing, 1984 Aug, pp 75–87.
23. F.J. Meyer, D.K. Pradhan, “Consensus with dual failure modes”, Proc. 17th Fault-Tolerant Computing Symp, 1987 Jul, pp 48–54.
24. D.L. Palumbo, R.W. Butler, “Measurement of SIFT operating system overhead”, NASA Technical Memo., 86322, 1985.
25. P. Ramanathan, D.D. Kandlur, K.G. Shin, “Hardware-assisted software clock synchronization for homogeneous distributed systems”, IEEE Trans. Computers, vol 39, 1990 Apr, pp 514–524.
26. F.B. Schneider, “Understanding protocols for byzantine clock synchronization”, Report No. 87-859, 1987 Aug; Cornell University, Dept. Computer Science.
27. K.G. Shin, P. Ramanathan, “Clock synchronization of a large multiprocessor system in the presence of malicious faults”, IEEE Trans. Computers, vol C-36, 1987 Jan, pp 2–12.
28. P.M. Thambidurai, Y-K. Park, “Interactive consistency with multiple failure modes”, Proc. 7th Reliable Distributed Systems Symp, 1988 Oct.
29. P.M. Thambidurai, Y-K. Park, K.S. Trivedi, “On reliability modeling of fault-tolerant distributed systems”, Proc. 9th Int'l. Conf. Distributed Computing Systems, 1989 Jun, pp 136–142.
30. N. Vasanthavada, P.N., Marinos, “Synchronization of fault-tolerant clocks in the presence of malicious failures”, IEEE Trans. Computers, vol 37, 1988 Apr, pp 440–448.
31. N. Vasanthavada, P.M. Thambidurai, P.N. Marinos, “Design of fault-tolerant clocks with realistic assumptions”, Proc. 18th Fault-Tolerant Computing Symp, 1989 Jun, pp 128–133.
32. C. Walter, M. Huge, N. Suri, “Continual on-line diagnosis of hybrid faults”, Proc. Fourth IFIP Working Conf. on Dependable Computing for Critical Applications (DCCA-4), 1994 Jan, pp 150–167.