An Almost Singularly Optimal Asynchronous Distributed MST Algorithm

10/03/2022
by   Fabien Dufoulon, et al.
0

A singularly (near) optimal distributed algorithm is one that is (near) optimal in two criteria, namely, its time and message complexities. For synchronous CONGEST networks, such algorithms are known for fundamental distributed computing problems such as leader election [Kutten et al., JACM 2015] and Minimum Spanning Tree (MST) construction [Pandurangan et al., STOC 2017, Elkin, PODC 2017]. However, it is open whether a singularly (near) optimal bound can be obtained for the MST construction problem in general asynchronous CONGEST networks. We present a randomized distributed MST algorithm that, with high probability, computes an MST in asynchronous CONGEST networks and takes Õ(D^1+ϵ + √(n)) time and Õ(m) messages, where n is the number of nodes, m the number of edges, D is the diameter of the network, and ϵ >0 is an arbitrarily small constant (both time and message bounds hold with high probability). Our algorithm is message optimal (up to a polylog(n) factor) and almost time optimal (except for a D^ϵ factor). Our result answers an open question raised in Mashregi and King [DISC 2019] by giving the first known asynchronous MST algorithm that has sublinear time (for all D = O(n^1-ϵ)) and uses Õ(m) messages. Using a result of Mashregi and King [DISC 2019], this also yields the first asynchronous MST algorithm that is sublinear in both time and messages in the KT_1 CONGEST model. A key tool in our algorithm is the construction of a low diameter rooted spanning tree in asynchronous CONGEST that has depth Õ(D^1+ϵ) (for an arbitrarily small constant ϵ > 0) in Õ(D^1+ϵ) time and Õ(m) messages. To the best of our knowledge, this is the first such construction that is almost singularly optimal in the asynchronous setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/04/2021

Singularly Near Optimal Leader Election in Asynchronous Networks

This paper concerns designing distributed algorithms that are singularly...
research
07/28/2019

Faster asynchronous MST and low diameter tree construction with sublinear communication

Building a spanning tree, minimum spanning tree (MST), and BFS tree in a...
research
10/08/2018

Time-Message Trade-Offs in Distributed Algorithms

This paper focuses on showing time-message trade-offs in distributed alg...
research
01/09/2022

Locality-Preserving Hashing for Shifts with Connections to Cryptography

Can we sense our location in an unfamiliar environment by taking a subli...
research
02/22/2023

Improved Deterministic Leader Election in Diameter-Two Networks

In this paper, we investigate the leader election problem in diameter-tw...
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
07/31/2023

Trade-off between Time, Space, and Workload: the case of the Self-stabilizing Unison

We present a self-stabilizing algorithm for the (asynchronous) unison pr...

Please sign up or login with your details

Forgot password? Click here to reset