14 search results - page 1 / 3 » Fast scalable deterministic consensus for crash failures |
PODC
2009
ACM
13 years 11 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...
SPAA
2009
ACM
13 years 11 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
WDAG
2010
Springer
13 years 3 months ago
2010
Springer
We present a scalable quantum algorithm to solve binary consensus in a system of n crash-prone quantum processes. The algorithm works in O(polylog n) time sending O(n polylog n) qu...
DC
1999
13 years 4 months ago
1999
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...
TC
2002
13 years 4 months ago
2002
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...