JavaScript is disabled for your browser. Some features of this site may not work without it.
Stopping Times of Distributed Consensus Protocols: A Probabilistic Analysis

Author
Babaoglu, Ozalp
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.
Date Issued
1986-05Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR86-756
Type
technical report