Error detection/correction and fault detection/recovery – Data processing system error or fault handling – Reliability and availability
Reexamination Certificate
1999-10-27
2001-05-29
Iqbal, Nadeem (Department: 2184)
Error detection/correction and fault detection/recovery
Data processing system error or fault handling
Reliability and availability
Reexamination Certificate
active
06240526
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
The invention relates in general to fault tolerant computer systems, and more particularly, to redundant fault tolerant computer systems.
2. Description of the Related Art
The reliability of computer system continues to become increasingly important as dependence upon computers continues to increase. See
Reliable Computer Systems,—Design and Evaluation,
by Daniel P. Siewiorek and Robert S. Swarz, Digital Press, 1992. Fault tolerant computer systems employ redundant elements to guard against system failure. If one redundant element fails then another element takes over for the failed element. For example, a typical triple modular redundant computer system may employ three processors. If one processor fails, then another of the tree processors is available to take over for the failed processor. See
Fault Tolerant Computer System Design,
by Dhiraj K. Pradhan, Prentice Hall, Inc., 1995.
REFERENCES:
patent: 3538498 (1970-11-01), Games et al.
patent: 3665173 (1972-05-01), Bouricius et al.
patent: 3848116 (1974-11-01), Moder et al.
patent: 3900741 (1975-08-01), Fletcher et al.
patent: 4015246 (1977-03-01), Hopkins, Jr. et al.
patent: 4356546 (1982-10-01), Whiteside et al.
patent: 4375683 (1983-03-01), Wensley
patent: 4392199 (1983-07-01), Schmitter et al.
patent: 4402045 (1983-08-01), Krol
patent: 4453215 (1984-06-01), Reid
patent: 4644498 (1987-02-01), Bedard et al.
patent: 4654857 (1987-03-01), Samson et al.
patent: 4726026 (1988-02-01), Hilford et al.
patent: 4750177 (1988-06-01), Hendrie et al.
patent: 4777332 (1988-10-01), Diaz
patent: 4817091 (1989-03-01), Katzman et al.
patent: 4819159 (1989-04-01), Shipley et al.
patent: 4870704 (1989-09-01), Matelan et al.
patent: 4907232 (1990-03-01), Harper et al.
patent: 4937734 (1990-06-01), Bechtolsheim
patent: 4965717 (1990-10-01), Cutts, Jr. et al.
patent: 4967347 (1990-10-01), Smith et al.
patent: 4972415 (1990-11-01), Walter et al.
patent: 4984241 (1991-01-01), Truong
patent: 5020024 (1991-05-01), Williams
patent: 5084878 (1992-01-01), Kanekawa et al.
patent: 5099485 (1992-03-01), Buckert et al.
patent: 5117442 (1992-05-01), Hall
patent: 5121487 (1992-06-01), Bechtolsheim
patent: 5146585 (1992-09-01), Smith, III
patent: 5193175 (1993-03-01), Cutts, Jr. et al.
patent: 5231640 (1993-07-01), Hanson et al.
patent: 5247628 (1993-09-01), Grohoski
patent: 5249188 (1993-09-01), McDonald
patent: 5249206 (1993-09-01), Appelbaum et al.
patent: 5269016 (1993-12-01), Butler et al.
patent: 5271023 (1993-12-01), Norman
patent: 5276823 (1994-01-01), Cutts, Jr. et al.
patent: 5295257 (1994-03-01), Berkovich et al.
patent: 5295258 (1994-03-01), Jewett et al.
patent: 5317726 (1994-05-01), Horst
patent: 5325518 (1994-06-01), Bianchini, Jr.
patent: 5361337 (1994-11-01), Okin
patent: 5410710 (1995-04-01), Sarangdhar et al.
patent: 5434997 (1995-07-01), Landry et al.
patent: 5448723 (1995-09-01), Rowett
patent: 5495615 (1996-02-01), Nizar et al.
patent: 5588111 (1996-12-01), Cutts, Jr. et al.
patent: 5613128 (1997-03-01), Nizar et al.
patent: 5630056 (1997-05-01), Horvath et al.
patent: 5689689 (1997-11-01), Meyers et al.
patent: 5696976 (1997-12-01), Nizar et al.
patent: 5701496 (1997-12-01), Nizar et al.
patent: 5740449 (1998-04-01), Densham et al.
patent: 5742753 (1998-04-01), Nordsieck et al.
patent: 5751955 (1998-05-01), Sonnier et al.
patent: 5787095 (1998-07-01), Myers et al.
patent: 5799022 (1998-08-01), Williams
patent: 5838900 (1998-11-01), Horvath et al.
patent: 5862366 (1999-01-01), Schmidt et al.
patent: 5881077 (1999-03-01), Densham et al.
patent: 5968159 (1999-10-01), Mattheis
patent: 6021457 (2000-02-01), Archer et al.
patent: 0 447 577 (1991-09-01), None
patent: 5-204692 (1993-08-01), None
patent: 6-250867 (1994-09-01), None
patent: 92/03787 (1992-03-01), None
patent: 94/02896 (1994-02-01), None
patent: 97/08320 (1998-12-01), None
Abraham et al., “An Algorithm for the Accurate Reliability Evaluation of Triple Modular Redundancy Networks,”IEEE Trans. on ComputersC-23(7):682-692 (Jul. 1974).
Ali et al., “TMR Crystal Controlled Clock,”Proceedings of the IEEE69(6):756-757 (Jun. 1981).
Avizienis, “Fault-Tolerant Computing-Progress, Problems, and Prospects,” in Proceedings IFIP Congress, pp. 405-420 (New York: North Holland 1977).
Brasileiro et al., “TMR Processing without Explicit Clock Synchronisation,”Proceedings of the IEEE Symposium on Reliable Distributed Systems,pp. 186-195 (IEEE, Los Alamitos, CA 1995).
Davies et al., “Synchronization and Matching in Redundant Systems,”IEEE Trans. on ComputersC-27(6):531-539 (Jun. 1978).
Gurzi, “Estimates for Best Placement of Voters in a Triplicated Logic Network,”IEEE Trans. on Elec. ComputersEC-14(5):711-717 (Oct. 1965).
Ihara et al., “Fault-Tolerant Computer System with Three Symmetric Computers,”Proceedings of the IEEE66(10):1160-1177 (Oct. 1978).
Lamport et al., The Byzantine Generals Problem,ACM Transactions on Programming Languages and Systems4(3):382-401 (Jul. 1982).
Lewis, “A Fault-Tolerant Clock Using Standby Sparing,” inDigest of 9th International Symposium on Fault-Tolerant Computing,pp. 33-39 (IEEE Computer Society, Madison, WI 1979).
Longden et al., “An Assessment of the Value of Triplicated Redundancy in Digital Systems,” inMicroelectronics and Reliability5:39-55 (Elmsford, NY: Pergamon Press 1966).
Lyons et al., “The Use of Triple-Modular Redundancy to Improve Computer Reliability,”IBM J. Res. and Dev.6(2):200-209 (Apr. 1962).
McCluskey et al., “Comparative Architecture of High-Availability Computer Systems,” inProc. CompCon,pp. 288-293 (IEEE 1977).
Ozguner et al., “A Reconfigurable Multiprocessor Architecture of Reliable Control of Robotic Systems,” 1985 IEEE International Conference on Robotics and Automation Mar. 25-28, 1985, pp. 802-806 (XP 000647411) (St. Louis, MO Mar. 25, 1985).
Pease et al., “Reaching Agreement in the Presence of Faults,”Journal of the ACM27(2):228-234 (Apr. 1980).
Pradhan,Fault-Tolerant Computer System Design,Chapter 2, pp. 102-122 (Prentice-Hall 1996).
Ramarao et al., “On the Diagnosis of Byzantine Faults,” inProceedings of 7th Symposium on Reliable Distributed Systems,pp. 144-153 (Columbus, OH 1988).
Shih, et al., A System Design For Real-Time Tolerant Computer Networks, IEEE, Trans. System Sciences, vol. 1, pp. 346-354 (Nov. 1989).
Upadhyyaya et al., Analysis of a Fault-Tolerant Scheme For Processor Ensembles, IEEE International Workshop, pp. 294-302 (Jun. 1992).
Wakerley, “Microcomputer Reliability Improvement Using Triple-Modular Redundancy,” Proc. IEEE 63(6):889-895 (Jun. 1976).
Williams, “New Approach Allows Painless Move to Fault Tolerance,”Computer Design31(5) (Littleton, MA May 1992).
Yoneda et al., “Interrupt Handling in the Loosely Synchronized TMR System,”Systems and Computers in Japan16(5):50-59 (1985).
Youn et al. Fault-Tolerant Sorting Using VLSI Processor Arrays, IEEE, International Workshop, pp. 25-32 (Sep. 1993).
Lundell Don C.
Lundell Jonathan K.
Petivan James L.
Iqbal Nadeem
Morrison & Foerster / LLP
Resilience Corporation
LandOfFree
Triple modular redundant computer system does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Triple modular redundant computer system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Triple modular redundant computer system will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2441887