Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

STOC
2007
ACM

favoriteEmaildiscussreport

92views Algorithms» more STOC 2007»

Tight bounds for asynchronous randomized consensus

14 years 5 months ago

Tight bounds for asynchronous randomized consensus

Download www.cs.technion.ac.il

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 within a finite number of its own steps, is impossible in an asynchronous shared-memory system. However, consensus becomes solvable using randomization when a pro

Hagit Attiya, Keren Censor

Real-time Traffic

Algorithms | Asynchronous Shared-memory System | Distributed Consensus Algorithm | STOC 2007 | Wait-free Consensus |

claim paper

Related Content

» Lower Bounds for Distributed CoinFlipping and Randomized Consensus

» Lower Bounds for Randomized Consensus under a Weak Adversary

» StaRSaC Stable Random Sample Consensus for Parameter Estimation

» Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV an...

» Byzantine disk paxos optimal resilience with byzantine shared memory

» Concurrent Timestamping Made Simple

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2007
Where	STOC
Authors	Hagit Attiya, Keren Censor

Comments (0)