Sciweavers

67 search results - page 1 / 14
» Randomized protocols for asynchronous consensus
Sort
View
9
Voted
CORR
2002
Springer
102views Education» more  CORR 2002»
13 years 4 months ago
Randomized protocols for asynchronous consensus
James Aspnes
CAV
2001
Springer
154views Hardware» more  CAV 2001»
13 years 8 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 4 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
13 years 10 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»
13 years 8 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