Sciweavers

10 search results - page 1 / 2
» Optimistically Terminating Consensus: All Asynchronous Conse...
Sort
View
ISPDC
2006
IEEE
14 years 1 months ago
Optimistically Terminating Consensus: All Asynchronous Consensus Protocols in One Framework
Optimistically Terminating Consensus (OTC) is a variant of Consensus that decides if all correct processes propose the same value. It is surprisingly easy to implement: processes ...
Piotr Zielinski
DSN
2006
IEEE
14 years 1 months ago
One-step Consensus with Zero-Degradation
In the asynchronous distributed system model, consensus is obtained in one communication step if all processes propose the same value. Assuming f < n/3, this is regardless of t...
Dan Dobre, Neeraj Suri
CAV
2001
Springer
154views Hardware» more  CAV 2001»
13 years 11 months ago
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
PODC
1999
ACM
13 years 12 months ago
On k-Set Consensus Problems in Asynchronous Systems
ÐIn this paper, we investigate the k-set consensus problem in asynchronous distributed systems. In this problem, each participating process begins the protocol with an input value...
Roberto De Prisco, Dahlia Malkhi, Michael K. Reite...
CDC
2008
IEEE
119views Control Systems» more  CDC 2008»
14 years 2 months ago
A set-membership approach to consensus problems with bounded measurement errors
— This paper analyzes two classes of consensus algorithms in presence of bounded measurement errors. The protocols taken into account adopt an updating rule based either on const...
Andrea Garulli, Antonio Giannitrapani