Affiliation:
1. Massachusetts Institute of Technology, Cambridge
2. The Weizmann Institute, Haifa, Israel
3. Stanford Univ., Stanford, CA
Abstract
This paper concerns the message complexity of broadcast in arbitrary point-to-point communication networks.
Broadcast
is a task initiated by a
single
processor that wishes to convey a message to all processors in the network. The widely accepted model of communication networks, in which each processor initially knows the identity of its neighbors but does not know the entire network topology, is assumed. Although it seems obvious that the number of messages required for broadcast in this model equals the number of links, no proof of this basic fact has been given before.
It is shown that the message complexity of broadcast depends on the exact complexity measure. If messages of unbounded length are counted at unit cost, then broadcast requires Θ(↿
V
↾) messages, where
V
is the set of processors in the network. It is proved that, if one counts messages of
bounded length
, then broadcast requires Θ(↿
E
↾) messages, where
E
is the set of edges in the network.
Assuming an intermediate model in which each vertex knows the topology of the network in radius
ρ
≥ 1 from itself, matching upper and lower bounds of Θ(min{↿
E
↾, ↿
V
↾
1+Θ(l)/ρ
}) is proved on the number of messages of bounded length required for broadcast. Both the upper and lower bounds hold for both synchronous and asynchronous network models.
The same results hold for the construction of spanning trees, and various other global tasks.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
67 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Communication costs in a geometric communication network;Theoretical Computer Science;2023-10
2. Distributed CONGEST Algorithms against Mobile Adversaries;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16
3. Improved Tradeoffs for Leader Election;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16
4. Brief Announcement: What Can We Compute in a Single Round of the Congested Clique?;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16
5. Improved distributed approximation for Steiner tree in the CONGEST model;Journal of Parallel and Distributed Computing;2021-12