Broadcasting Spanning Forests on a Multiple-Access Channel

12/31/2017
by   Bogdan S. Chlebus, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/27/2020

k-ported vs. k-lane Broadcast, Scatter, and Alltoall Algorithms

In k-ported message-passing systems, a processor can simultaneously rece...
research
05/19/2019

Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators

We develop techniques to prove lower bounds for the BCAST(log n) Broadca...
research
05/16/2018

Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest

This paper gives a new deterministic algorithm for the dynamic Minimum S...
research
06/12/2018

Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model

We provide the first asynchronous distributed algorithms to compute broa...
research
12/29/2021

Broadcasting on Adversarial Multiple Access Channels

We study broadcasting on multiple-access channels under adversarial pack...
research
07/13/2018

Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation

We show optimal lower bounds for spanning forest computation in two diff...
research
04/06/2023

Asymptotically Faster Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

The CONGEST and CONGEST-CLIQUE models have been carefully studied to rep...

Please sign up or login with your details

Forgot password? Click here to reset