Exploiting omissive faults in synchronous approximate agreement

IEEE Transactions on Computers

Volumn 49, Issue 10, 2000, Pages 1031-1042

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

^a IEEE   (United States)

^b UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

^c Michigan Technological University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLOCK SYNCHRONIZATION; CONVERGENT VOTING ALGORITHMS; FAULT TOLERANT DISTRIBUTED SYSTEMS; OMISSION MEAN SUBSEQUENCE REDUCED; OMISSIVE FAULTS; SYNCHRONOUS APPROXIMATE AGREEMENT;

ALGORITHMS; COMPUTER SIMULATION; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; ERROR CORRECTION; THEOREM PROVING;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0034291559     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.888039     Document Type: Article

References (29)

1. M.H. Azadmanesh and R.M. Kieckhafer, "Synchronous Approximate Agreement in the Presence of Transmissive and Omissive Failure Modes," Technical Report no. TR-98-01, Dept. of Computer Science, Univ. of Nebraska at Omaha, 1998.
2. M.H. Azadmanesh and A.W. Krings, "Egocentric Voting Algorithms," IEEE Trans. Reliability, vol. 46, no. 4, pp. 494-502, Dec. 1997.
3. M.H. Azadmanesh and R.M. Kieckhafer, "New Hybrid Fault Models for Asynchronous Approximate Agreement," IEEE Trans. Computers, vol. 45, no. 4, pp. 439-449, Apr. 1996.
4. M. Barborak and M. Malek, "The Consensus Problem in Fault-Tolerant Computing," ACM Computing Surveys, vol. 25, no. 2, pp. 172-220, June 1993.
5. K. Birman, "Replication and Fault-Tolerance in the ISIS System," Proc. 10th ACM SIGOPS Symp. Operating Systems Principles, pp. 79-86, Dec. 1985.
6. F. Cristian, H. Aghili, R. Strong, and D. Dolev, "Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement," Proc. 15th Int'l Symp. Fault-Tolerant Computing, pp. 200-206, June 1985.
7. F. Cristian, H. Aghili, and R. Strong, "Clock Synchronization in the Presence of Omission and Performance Faults, and Processor Joins," Proc. 16th Int'l Conf. Fault-Tolerant Computing, 1986.
8. F. Cristian, D. Dolev, R. Strong, and H. Aghili, "Atomic Broadcast in a Real-Time Environment," IBM Research Report, Almaden Research Center, 1989.
9. D. Dolev, N.A. Lynch, S.S. Pinter, E.W. Stark, and W.E. Weihl, "Reaching Approximate Agreement in the Presence of Faults," Proc. Third Symp. Reliability in Distributed Software and Database Systems, pp. 145-154, Oct. 1983.
10. D. Dolev, N.A. Lynch, S.S. Pinter, W.E. Stark, and E.W. Weihl, "Reaching Approximate Agreement in the Presence of Faults," J. ACM, vol. 33, no. 3, pp. 499-516, July 1986.
11. A.D. Fekete, "Asymptotically Optimal Algorithms for Approximate Agreement," Distributed Computing, vol. 4, pp. 9-29, 1990.
12. J.L.W. Kessels, "Two Designs of a Fault-Tolerant Clocking System," IEEE Trans. Computers, vol. 33, no. 10, pp. 912-919, Oct. 1984.
13. R.M. Kieckhafer, C.J. Walter, A.M. Finn, and P.M. Thambidurai, "The MAFT Architecture for Distributed Fault-Tolerance," IEEE Trans. Computers, vol. 37, no. 4, pp. 398-405, Apr. 1988.
14. R.M. Kieckhafer and M.H. Azadmanesh, "Reaching Approximate Agreement with Mixed Mode Faults," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 1, pp. 53-63, Jan. 1994.
15. R.M. Kieckhafer and M.H. Azadmanesh, "Unified Approach to Synchronous and Asynchronous Approximate Agreement in the Presence of Hybrid Faults," IEEE Trans. Reliability, vol. 44, no. 4, Dec. 1995.
16. C.M. Krishna, K.G. Shin, and R.W. Butler, "Ensuring Fault Tolerance of Phase-Locked Clocks," IEEE Trans. Computers, vol. 34, no. 8, pp. 752-756, Aug. 1985.
17. L. Lamport et al., "The Byzantine Generals Problem," ACM TOPLAS, vol. 4, no. 3, pp. 382-401, July 1982.
18. L. Lamport and 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 and J. Rushby, "The Formal Verification of an Algorithm for Interactive Consistency under a Hybrid Fault Model," Proc. Fifth Int'l Conf. Computer Aided Verification, pp. 292-304, 1993.
20. J. Lundelius and N. Lynch, "A New Fault-Tolerant Algorithm for Clock Synchronization," Proc. Third Symp. Principles of Distributed Computing, pp. 75-87, Aug. 1984.
21. F.J. Meyer and D.K. Pradhan, "Consensus with Dual Failure Modes," Proc. 17th Fault-Tolerant Computing Symp., pp. 48-54, July 1987.
22. M. Pease et al., "Reaching Agreement in the Presence of Faults," J. ACM, vol. 27, no. 2, pp. 228-234, Apr. 1980.
23. R. Plunkett and A. Fekete, "Approximate Agreement with Mixed Mode Faults," Proc. 12th Int'l Symp. Distributed Computing, pp. 333-346, Sept. 1998.
24. J. Rushby, "A Formally Verified Algorithm for Clock Synchronization under a Hybrid Fault Model," Proc. 13th ACM Symp. Principles of Distributed Computing, pp. 304-313, 1994.
25. F.B. Schneider, "Understanding Protocols for Byzantine Clock Synchronization," Report No. 87-859, Dept. of Computer Science, Cornell Univ., Aug. 1987.
26. N. Suri, M. Hugue, and C. Walter, "Fault Classification and Distribution Effects on the Reliability Modeling of Large Fault-Tolerant Systems," Proc. 22nd Fault-Tolerant Computing Symp., pp. 212-220, July 1992.
27. P.M. Thambidurai and Y.K. Park, "Interactive Consistency with Multiple Failure Modes," Proc. Seventh Reliable Distributed Systems Symp., Oct. 1988.
28. P. Thambidurai, A.M. Finn, R.M. Kieckhafer, and C.J. Walter, "Clock Synchronization in MAFT," Proc. 19th Fault-Tolerant Computing Symp., pp. 142-151, June 1989.
29. C. Walter, M. Hugue, and N. Suri, "Continual On-Line Diagnosis of Hybrid Faults," Dependable Computing for Critical Applications 4, F. Cristian, G. Lann, T. Lunt, eds., pp. 233-250, 1995.