Sciweavers

67 search results - page 2 / 14
» Randomized protocols for asynchronous consensus
Sort
View
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
14 years 2 months ago
Distributed Agreement with Optimal Communication Complexity
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
Seth Gilbert, Dariusz Kowalski
SIAMCOMP
1998
98views more  SIAMCOMP 1998»
13 years 4 months ago
Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
We present a consensus algorithm that combines unreliable failure detection and randomization, two well-known techniques for solving consensus in asynchronous systems with crash f...
Marcos Kawazoe Aguilera, Sam Toueg
STOC
2001
ACM
147views Algorithms» more  STOC 2001»
14 years 5 months ago
Conditions on input vectors for consensus solvability in asynchronous distributed systems
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...
Achour Mostéfaoui, Michel Raynal, Sergio Ra...
CORR
2006
Springer
161views Education» more  CORR 2006»
13 years 4 months ago
Consensus Propagation
We propose consensus propagation, an asynchronous distributed protocol for averaging numbers across a network. We establish convergence, characterize the convergence rate for regul...
Ciamac Cyrus Moallemi, Benjamin Van Roy
DC
1999
13 years 4 months ago
A Simple and Fast Asynchronous Consensus Protocol Based on a Weak Failure Detector
or fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus can serve as a basic building blo...
Michel Hurfin, Michel Raynal