Lower bounds on communication complexity in distributed computer networks
Journal of the ACM (JACM)
Extended impossibility results for asynchronous complete networks
Information Processing Letters
New lower bound techniques for distributed leader finding and other problems on rings of processors
Theoretical Computer Science
Two lower bounds in asynchronous distributed computation
Journal of Computer and System Sciences
Gap theorems for distributed computation
SIAM Journal on Computing
The distributed bit complexity of the ring: from the anonymous to the non-anonymous case
Information and Computation
Introduction to distributed algorithms
Introduction to distributed algorithms
The linear-array problem in communication complexity resolved
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Efficient player-optimal protocols for strong and differential consensus
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Exact communication costs for consensus and leader in a tree
Journal of Discrete Algorithms
Two absolute bounds for distributed bit complexity
Theoretical Computer Science
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
About randomised distributed graph colouring and graph partition algorithms
Information and Computation
Trading bit, message, and time complexity of distributed algorithms
DISC'11 Proceedings of the 25th international conference on Distributed computing
An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
On the time and the bit complexity of distributed randomised anonymous ring colouring
Theoretical Computer Science
Information and Computation
Hi-index | 0.01 |
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed but have distinct identities, taken from {0, 1,… ,M − 1}. We investigate the communication costs of three well studied tasks: Consensus, Leader, and MaxF (finding the maximum identity). We show that in chain and ring topologies, the message complexities of all three tasks are the same. Hence, we study a finer measure of complexity: the number of transmitted bits required to solve a task T, denoted BitC(T). We prove several new lower bounds (and some simple upper bounds) that imply the following results: For the two processors case, BitC(Consensus) = 2 and BitC(Leader) = BitC(MaxF) = 2log2 M ± O(1), where the gap between the lower and upper bounds is almost always 1. For a chain, BitC(Consensus) = Θ(n), BitC(Leader) = Θ(n + log M), and BitC(MaxF) = Θ(n log M). For the ring topology, we prove the lower bound of Ω(n log M) for Leader, and (hence) MaxF. We consider also a chain where the intermediate processors have no identities. We prove that BitC(Leader) = Θ(n log M), which is equal to n times the bit complexity of the problem for two processors. For the specific case when the chain length is even, we prove that BitC(Leader) = Θ(n), for both above settings. In addition, we show that for any algorithm solving MaxF, there exists an input, for which every execution has the bit complexity Ω(n log M) (this is not the case for Leader). In our proofs, we use both methods of distributed computing and of communication complexity theory, establishing new links between the two areas.