Two absolute bounds for distributed bit complexity

Authors:
Yefim Dinitz;Noam Solomon
Affiliations:
Department of Computer Science, Ben-Gurion University of the Negev, POB 653, Beer-Sheva 84105, Israel;Department of Mathematics, Ben-Gurion University of the Negev, POB 653, Beer-Sheva 84105, Israel
Venue:
Theoretical Computer Science
Year:
2007

Citing 6
Cited 1

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
Distributed Algorithms

Distributed Algorithms
Exact communication costs for consensus and leader in a tree

Journal of Discrete Algorithms
Distributed Computing: Fundamentals, Simulations and Advanced Topics

Distributed Computing: Fundamentals, Simulations and Advanced Topics

Bit complexity of breaking and achieving symmetry in chains and rings

Journal of the ACM (JACM)

Quantified Score

Hi-index	5.23

Visualization

Abstract

The concept of distributed communication bit complexity was introduced by Dinitz, Rajsbaum, and Moran. They studied the bit complexity of Consensus and Leader Election, arriving at more or less exact bounds. This paper answers two questions on Leader Election, which remained there open. The first is to close the gap between the known upper and lower bounds, for electing a leader by two linked processors. The second is whether the suggested algorithm, sending 1.5n bits while electing a leader in a chain of even length n, is optimal, in the case when n is known to the processors. For both problems, absolutely exact bounds are found. Moreover, the presented lower bound proofs show that there is no optimal algorithm other than the suggested ones.