Distributed MIS in O(log log n) Awake Complexity

DOI10.1145/3583668.3594574MaRDI QIDQ6202235zbMATH OpenOpenAlexWikidataFDO

Authors Fabien Dufoulon, William K. jun. Moses, Gopal Pandurangan

Publication date 26 March 2024

Published in Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2204.08359

zbMATH Keywords

maximal independent setround complexityenergy-efficienttrade-offsawake complexitysleeping model

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Abstract: Maximal Independent Set (MIS) is one of the fundamental and most well-studied problems in distributed graph algorithms. Even after four decades of intensive research, the best-known (randomized) MIS algorithms have $O(logn)$ round complexity on general graphs [Luby, STOC 1986] (where $n$ is the number of nodes), while the best-known lower bound is $Omega(sqrtlogn/loglogn)$ [Kuhn, Moscibroda, Wattenhofer, JACM 2016]. Breaking past the $O(logn)$ round complexity upper bound or showing stronger lower bounds have been longstanding open problems. Our main contribution is to show that MIS can be computed in awake complexity that is emph{exponentially} better compared to the best known round complexity of $O(logn)$ and also bypassing its fundamental $Omega(sqrtlogn/loglogn)$ round complexity lower bound exponentially. Specifically, we show that MIS can be computed by a randomized distributed (Monte Carlo) algorithm in $O(loglogn)$ awake complexity with high probability. However, this algorithm has a round complexity that is $O(poly(n))$. We then show how to drastically improve the round complexity at the cost of a slight increase in awake complexity by presenting a randomized distributed (Monte Carlo) algorithm for MIS that, with high probability computes an MIS in $O((loglogn)lo{g}^{\ast }n)$ awake complexity and $O((lo{g}^{3}n)(loglogn)lo{g}^{\ast }n)$ round complexity. Our algorithms work in the CONGEST model where messages of size $O(logn)$ bits can be sent per edge per round.

Cites work

• scientific article; zbMATH DE number 2080260 (Why is no real title available?)
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• A fast and simple randomized parallel algorithm for the maximal independent set problem
• An Improved Distributed Algorithm for Maximal Independent Set
• Distributed Computing: A Locality-Sensitive Approach
• Distributed algorithms for random graphs
• Efficient algorithms for leader election in radio networks
• Exponential Separations in the Energy Complexity of Leader Election
• Local computation: lower and upper bounds
• MIS on trees
• Making evildoers pay, resource-competitive broadcast in sensor networks
• Parallel graph algorithms that are efficients on average
• Polylogarithmic-time deterministic network decomposition and distributed derandomization
• Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
• Sleeping is Efficient: MIS in O (1)-rounds Node-averaged Awake Complexity
• Sleeping on the job: energy-efficient and robust broadcast for radio networks
• Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
• The Energy Complexity of BFS in Radio Networks
• The energy complexity of broadcast
• The locality of distributed symmetry breaking
• Tight analysis of parallel randomized greedy MIS

This page was built for publication: Distributed MIS in O(log log n) Awake Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202235)