Sciweavers

67 search results - page 1 / 14
» Randomized protocols for asynchronous consensus
Sort
View
CAV
2001
Springer
154views Hardware» more  CAV 2001»
14 years 1 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...
STOC
2007
ACM
92views Algorithms» more  STOC 2007»
14 years 10 months ago
Tight bounds for asynchronous randomized consensus
A distributed consensus algorithm allows n processes to reach a common decision value starting from individual inputs. Wait-free consensus, in which a process always terminates wi...
Hagit Attiya, Keren Censor
ISPDC
2006
IEEE
14 years 3 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
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
14 years 1 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes