eCommons

 

Simple and Efficient Byzantine General Algorithms with Early Stopping

dc.contributor.authorToueg, Samen_US
dc.contributor.authorPerry, Kenneth J.en_US
dc.contributor.authorSrikanth, T. K.en_US
dc.date.accessioned2007-04-23T16:52:13Z
dc.date.available2007-04-23T16:52:13Z
dc.date.issued1984-07en_US
dc.description.abstractWe describe a Byzantine Agreement algorithm, with early stopping, for systems with arbitrary process failures. The algorithm presented is simpler and more efficient than those previously known. It was derived using a broadcast primitive that provides properties of message authentication and thus restricts the disruptive behavior of faulty processes. This primitive is a general tool for deriving fault-tolerant algorithms in the presence of arbitrary failures.en_US
dc.format.extent2196672 bytes
dc.format.extent410928 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-621en_US
dc.identifier.urihttps://hdl.handle.net/1813/6460
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleSimple and Efficient Byzantine General Algorithms with Early Stoppingen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
84-621.pdf
Size:
2.09 MB
Format:
Adobe Portable Document Format
No Thumbnail Available
Name:
84-621.ps
Size:
401.3 KB
Format:
Postscript Files