Distributed MIS in O(log log n) Awake Complexity

DOI10.1145/3583668.3594574arXiv2204.08359OpenAlexW4380873944WikidataQ130818759 ScholiaQ130818759MaRDI QIDQ6202235FDOQ6202235

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)

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}^{*}n)$ awake complexity and $O((lo{g}^{3}n)(loglogn)lo{g}^{*}n)$ round complexity. Our algorithms work in the CONGEST model where messages of size $O(logn)$ bits can be sent per edge per round.

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)

Cites Work

• Distributed Computing: A Locality-Sensitive Approach
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• A fast and simple randomized parallel algorithm for the maximal independent set problem
• Local Computation
• Distributed algorithms for random graphs
• Efficient algorithms for leader election in radio networks
• The Locality of Distributed Symmetry Breaking
• Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
• Sleeping on the job: energy-efficient and robust broadcast for radio networks
• An Improved Distributed Algorithm for Maximal Independent Set
• Title not available (Why is that?)
• Polylogarithmic-time deterministic network decomposition and distributed derandomization
• Title not available (Why is that?)
• Parallel graph algorithms that are efficients on average
• Making evildoers pay
• Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
• The Energy Complexity of Broadcast
• Exponential Separations in the Energy Complexity of Leader Election
• The Energy Complexity of BFS in Radio Networks
• MIS on trees
• Sleeping is Efficient: MIS in O (1)-rounds Node-averaged Awake Complexity

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)