481 search results - page 19 / 97 » Distributed Consensus, revisited |
JPDC
2008
13 years 8 months ago
2008
This paper proposes a variation of the Byzantine generals problem (or Byzantine consensus). Each general has a set of good plans and a set of bad plans. The problem is to make all...
PODC
2009
ACM
14 years 3 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
CONCUR
2008
Springer
13 years 10 months ago
2008
Springer
PODC
2011
ACM
12 years 11 months ago
2011
ACM
We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may...
PRDC
2007
IEEE
14 years 3 months ago
2007
IEEE
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...