|
eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1813/6596
| Title: | Stopping Times of Distributed Consensus Protocols: A Probabilistic Analysis |
| Authors: | Babaoglu, Ozalp |
| Keywords: | computer science
technical report |
| Issue Date: | May-1986 |
| Publisher: | Cornell University |
| Citation: | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR86-756 |
| Abstract: | Given 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. |
| URI: | http://hdl.handle.net/1813/6596 |
| Appears in Collections: | Computer Science Technical Reports
|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.
|
