67 search results - page 8 / 14 » Randomized protocols for asynchronous consensus |
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We define two new classes of shared-memory objects: ratifiers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...
WDAG
2007
Springer
15 years 3 months ago
2007
Springer
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
120
click to vote
SIAMCOMP
2008
14 years 8 months ago
2008
Abstract. To cope with the impossibility of solving agreement problems in asynchronous systems made up of n processes and prone to t process crashes, system designers tailor their ...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
— The paper studies distributed average consensus in sensor networks, when the sensors exchange quantized data at each time step. We show that randomizing the exchanged sensor da...