Two absolute bounds for distributed bit complexity

Yefim Dinitz, Noam Solomon

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

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.5 n 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.

Original languageEnglish
Pages (from-to)168-183
Number of pages16
JournalTheoretical Computer Science
Volume384
Issue number2-3
DOIs
StatePublished - 1 Oct 2007

Keywords

  • Absolute bound
  • Bit complexity
  • Distributed computing
  • Leader election

Fingerprint

Dive into the research topics of 'Two absolute bounds for distributed bit complexity'. Together they form a unique fingerprint.

Cite this