481 search results - page 26 / 97 » Distributed Consensus, revisited |
PDCAT
2005
Springer
14 years 2 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
DSN
2007
IEEE
14 years 22 days ago
2007
IEEE
Model-checking of asynchronous distributed protocols is challenging because of the large size of the state and solution spaces. This paper tackles this problem in the context of l...
PODC
2010
ACM
14 years 21 days 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...
PODC
2012
ACM
11 years 11 months ago
2012
ACM
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that gu...
ICASSP
2011
IEEE
13 years 16 days ago
2011
IEEE
Many models of wireless sensor networks (WSNs) assume a perfect synchronization along the graph of such network as a simplifying assumption. In our contribution we base our invest...