Sorting and selecting in rounds
SIAM Journal on Computing
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Time-optimal message-efficient work performance in the presence of faults
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Bounds on information exchange for Byzantine agreement
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Fully Polynomial Byzantine Agreement for Processors in Rounds
SIAM Journal on Computing
Performing Work Efficiently in the Presence of Faults
SIAM Journal on Computing
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Loss-less condensers, unbalanced expanders, and extractors
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Information Dissemination in Distributed Systems with Faulty Units
IEEE Transactions on Computers
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Resolving message complexity of Byzantine Agreement and beyond
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Collective asynchronous reading with polylogarithmic worst-case overhead
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Spatial gossip and resource location protocols
Journal of the ACM (JACM)
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
Explicit Combinatorial Structures for Cooperative Distributed Algorithms
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Efficient gossip and robust distributed computation
Theoretical Computer Science
On the message complexity of binary byzantine agreement under crash failures
Distributed Computing
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
On the complexity of asynchronous gossip
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Fast scalable deterministic consensus for crash failures
Proceedings of the 28th ACM symposium on Principles of distributed computing
Locally scalable randomized consensus for synchronous crash failures
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Scalable quantum consensus for crash failures
DISC'10 Proceedings of the 24th international conference on Distributed computing
On the communication surplus incurred by faulty processors
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Journal of the ACM (JACM)
Hi-index | 0.00 |
This paper is about consensus solutions optimized simultaneously for the time and communication complexities. Synchronous message passing with processors prone to crashes is the computing environment. The number f of crashes can be arbitrary as long as it is smaller than the number n of processors in the system. As a building block to our consensus solutions, we consider the gossiping problem in which processors have input rumors and the goal of every processor is to learn all the rumors of the processors that have not crashed. We show that gossiping can be achieved by a deterministic algorithm working in ${{\mathcal O}}(\log^3 n)$ time and sending ${{\mathcal O}}(n\log^4 n)$ point-to-point messages. These results improve upon the best previously known deterministic solution of gossiping that operated in ${{\mathcal O}}(\log^2 n)$ time and generated ${{\mathcal O}}(n^{1+\varepsilon})$ messages, for any constant ε0. The efficient gossiping algorithm is applied to the problem of reaching consensus. In the Consensus problem, each processor starts with its input value and the goal is to have all processors agree on exactly one value among the inputs. First we develop a deterministic algorithm solving Consensus in ${{\mathcal O}}(n)$ time while sending ${{\mathcal O}}(n \log^5 n)$ messages. The best previously known algorithms solving Consensus in ${{\mathcal O}}(n)$ time had the message complexity bounded by ${{\mathcal O}}(n^{1+\varepsilon})$, for any constant ε0. Next we improve the Consensus solution so that it is early stopping, which means that it terminates in ${{\mathcal O}}(f+1)$ time, where f is the number of crashes in an execution, while preserving the message complexity ${{\mathcal O}}(n \log^5 n)$.