Computer system resilient to a wide class of failures

Details Computer system resilient to a wide class of failures Computer system resilient to a wide class of failures

1995-04-03

1997-01-28

Beausoliel, Jr., Robert W.

Excavating

371 36, G06F 1134

Patent

active

055985297

ABSTRACT:
This invention includes a consensus protocol, a broadcast protocol and a fault tolerant computer system created by using the two protocols together in combination. The protocols and system use the minimum number of processors to create a system tolerant of concurrent processor crash and byzantine failures. The protocols are subject to certain validity conditions. The system in the state of consensus is guaranteed to have all non-faulty processors in agreement as to what action the system should take. The system and protocols can tolerate up to t total number of processor failures, no more than b of which may fail in the byzantine mode.

REFERENCES:
patent: 4356546 (1982-10-01), Whiteside et al.
patent: 4569015 (1986-02-01), Dolev et al.
patent: 4644542 (1987-02-01), Aghili et al.
patent: 4771427 (1988-09-01), Tulpule et al.
patent: 4816989 (1989-03-01), Finn et al.
patent: 4907232 (1990-03-01), Harper et al.
patent: 4914657 (1990-04-01), Walter et al.
patent: 4980857 (1990-12-01), Walter et al.
patent: 5193175 (1993-03-01), Cutts, Jr. et al.
patent: 5210871 (1993-05-01), Lala et al.
patent: 5216675 (1993-06-01), Melliar-Smith et al.
patent: 5269016 (1993-12-01), Butler et al.
patent: 5276823 (1994-01-01), Cutts, Jr. et al.
Fault-Tolerant Computing Symposium (FTCS 17), 6 Jul. 1987, Pennsylvania, USA 48-54, XP002006783, F. J. Meyer et al. "Consensus with Dual Failure Modes" *p. 51, left-hand column, line 3 - right-hand column, line 28*.
Proceedings 7th Symp. on Reliable Distributed Systems, 10 Oct. 1988, Columbus, OH, USA, pp. 93-100, XP000573312, P. Thambidurai et al.: "Interactive consistency with Multiple failure Modes:" *p. 96, left-hand column, line 13 - right-hand column, line 34 *.
Proc. 11th Int. Conf. of the Chilean Computer Society, 15 Oct. 1991, Santiago, Chile, pp. 313-321, XP002006784, P. Berman et al.: "BIT Optimal Distributed Consensus".
Eugene S. Amdur et al. (On the message complexity of binary byzantine agreement under crash failures, 1992, pp. 175-186.
Bracha, G.; An O(log n) Expected Rounds randomized Byzantine generals protocol, (Oct. 1987) pp. 910-920.
Bracha, G. and Toueg, S.; Asynchronous consensus and Broadcast protocols; (Oct. 1985) pp. 824-840.
IBM TDB vol. 30 No. 11 Apr. 1988, Family of Early-Delivery Atomic Broadcast Protocols.
IBM TDB vol. 30 No. 11 Apr. 1988, Polynomial Byzantine Agreement Protocols.

Affiliated with

Also associated with

Rating

Computer system resilient to a wide class of failures does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Computer system resilient to a wide class of failures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computer system resilient to a wide class of failures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-947173