Exact communication costs for consensus and leader in a tree

Authors:
Yefim Dinitz;Shlomo Moran;Sergio Rajsbaum
Affiliations:
Department of Computer Science, Ben-Gurion University of the Negev, Israel;Department of Computer Science, Technion, Israel;Compaq Cambridge Research Laboratory, MA
Venue:
Journal of Discrete Algorithms
Year:
2003

Citing 12
Cited 4

Distributed algorithms for finding centers and medians in networks

ACM Transactions on Programming Languages and Systems (TOPLAS)
Lower bounds on communication complexity in distributed computer networks

Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
The linear-array conjecture in communication complexity is false

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The linear-array problem in communication complexity resolved

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Communication complexity

Communication complexity
Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the totalk-diameter of connection networks

Theoretical Computer Science
Decentralized extrema-finding in circular configurations of processors

Communications of the ACM
Distributed computing: fundamentals, simulations and advanced topics

Distributed computing: fundamentals, simulations and advanced topics
Distributed Algorithms

Distributed Algorithms
Some complexity questions related to distributive computing(Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing

Two absolute bounds for distributed bit complexity

Theoretical Computer Science
Bit complexity of breaking and achieving symmetry in chains and rings

Journal of the ACM (JACM)
Multiparty equality function computation in networks with point-to-point links

SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Two absolute bounds for distributed bit complexity

SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We continue the study of communication costs of Consensus and Leader initiated in a previous paper. We deal with all scenarios with linear complexity in a tree topology, and prove exact (as opposed to asymptotic) tight bounds for the bit and message complexities. A particular scenario depends on whether the tree size or the size parity is known to the processors.