Show simple item record

dc.contributor.authorBabaoglu, Ozalpen_US
dc.date.accessioned2007-04-23T17:14:33Z
dc.date.available2007-04-23T17:14:33Z
dc.date.issued1986-05en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR86-756en_US
dc.identifier.urihttps://hdl.handle.net/1813/6596
dc.description.abstractGiven a model where each processor remains correct for an exponentially distributed random time and then fails independently of the others, we characterize system executions that permit the processors to reach consensus. We show that with non-zero probability, a protocol can achieve consensus even during executions where the number of actual processors to fail exceeds its resiliency.en_US
dc.format.extent1076576 bytes
dc.format.extent249262 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleStopping Times of Distributed Consensus Protocols: A Probabilistic Analysisen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics