Broadcasting Spanning Forests on a Multiple-Access Channel

Bogdan S. Chlebus, Karol Gola̧b, Dariusz R. Kowalski

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish (US)
Pages (from-to)711-733
Number of pages23
JournalTheory of Computing Systems
Volume36
Issue number6
DOIs
StatePublished - Nov 1 2003
Externally publishedYes

Fingerprint

Spanning Forest
Multiple Access Channel
Broadcasting
Broadcast
Optimality
Distributed Processing
Randomized Algorithms
Graph in graph theory
Processing
Justify
Lower bound
Output

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Broadcasting Spanning Forests on a Multiple-Access Channel. / Chlebus, Bogdan S.; Gola̧b, Karol; Kowalski, Dariusz R.

In: Theory of Computing Systems, Vol. 36, No. 6, 01.11.2003, p. 711-733.

Research output: Contribution to journalArticle

Chlebus, Bogdan S. ; Gola̧b, Karol ; Kowalski, Dariusz R. / Broadcasting Spanning Forests on a Multiple-Access Channel. In: Theory of Computing Systems. 2003 ; Vol. 36, No. 6. pp. 711-733.
@article{0ef4aa3f1d8048da858bf9484cf78331,
title = "Broadcasting Spanning Forests on a Multiple-Access Channel",
abstract = "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.",
author = "Chlebus, {Bogdan S.} and Karol Gola̧b and Kowalski, {Dariusz R.}",
year = "2003",
month = "11",
day = "1",
doi = "10.1007/s00224-003-1149-8",
language = "English (US)",
volume = "36",
pages = "711--733",
journal = "Theory of Computing Systems",
issn = "1432-4350",
publisher = "Springer New York",
number = "6",

}

TY - JOUR

T1 - Broadcasting Spanning Forests on a Multiple-Access Channel

AU - Chlebus, Bogdan S.

AU - Gola̧b, Karol

AU - Kowalski, Dariusz R.

PY - 2003/11/1

Y1 - 2003/11/1

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

VL - 36

SP - 711

EP - 733

JO - Theory of Computing Systems

JF - Theory of Computing Systems

SN - 1432-4350

IS - 6

ER -