TY - JOUR
T1 - Broadcasting Spanning Forests on a Multiple-Access Channel
AU - Chlebus, Bogdan S.
AU - Gola̧b, Karol
AU - Kowalski, Dariusz R.
N1 - Funding Information:
∗ A preliminary version of this paper appeared as “Finding spanning forests by broadcasting,” in Proceedings, 9th International Colloquium on Structural Information and Communication Complexity, Andros, Greece, 2002, pp. 41–56. The research of the first author was supported in part by NSF Grant 0310503.
PY - 2003/11
Y1 - 2003/11
N2 - The problem of finding a spanning forest of a graph in a distributed-processing environment is studied. If an input graph is weighted, then the goal is to find a minimum-weight spanning forest. The processors communicate by broadcasting. The output consists of the edges that make a spanning forest and have been broadcast on the network. Input edges are distributed among the processors, with each edge held by one processor. The underlying broadcast network is implemented as a multiple-access channel. If exactly one processor attempts to perform a broadcast, then the broadcast is successful. A message broadcast successfully is delivered to all the processors in one step. If more than one processors broadcast simultaneously, then the messages interfere with each other and no processor can receive any of them. Optimality of algorithmic solutions is investigated, by way of comparing deterministic with randomized algorithms, and adaptive with oblivious ones. Lower bounds are proved that either justify the optimality of specific algorithms or show that the optimal performance depends on a class of algorithms.
AB - The problem of finding a spanning forest of a graph in a distributed-processing environment is studied. If an input graph is weighted, then the goal is to find a minimum-weight spanning forest. The processors communicate by broadcasting. The output consists of the edges that make a spanning forest and have been broadcast on the network. Input edges are distributed among the processors, with each edge held by one processor. The underlying broadcast network is implemented as a multiple-access channel. If exactly one processor attempts to perform a broadcast, then the broadcast is successful. A message broadcast successfully is delivered to all the processors in one step. If more than one processors broadcast simultaneously, then the messages interfere with each other and no processor can receive any of them. Optimality of algorithmic solutions is investigated, by way of comparing deterministic with randomized algorithms, and adaptive with oblivious ones. Lower bounds are proved that either justify the optimality of specific algorithms or show that the optimal performance depends on a class of algorithms.
UR - http://www.scopus.com/inward/record.url?scp=0346991377&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0346991377&partnerID=8YFLogxK
U2 - 10.1007/s00224-003-1149-8
DO - 10.1007/s00224-003-1149-8
M3 - Article
AN - SCOPUS:0346991377
SN - 1432-4350
VL - 36
SP - 711
EP - 733
JO - Theory of Computing Systems
JF - Theory of Computing Systems
IS - 6
ER -