An optimal bit complexity randomized distributed MIS algorithm

@article{Mtivier2010AnOB,
  title={An optimal bit complexity randomized distributed MIS algorithm},
  author={Y. M{\'e}tivier and J. Robson and N. Saheb-Djahromi and A. Zemmari},
  journal={Distributed Computing},
  year={2010},
  volume={23},
  pages={331-340}
}
We present a randomized distributed maximal independent set (MIS) algorithm for arbitrary graphs of size n that halts in time O(log n) with probability 1 − o(n−1), and only needs messages containing 1 bit. Thus, its bit complexity par channel is O(log n). We assume that the graph is anonymous: unique identities are not available to distinguish between the processes; we only assume that each vertex distinguishes between its neighbours by locally known channel names. Furthermore we do not assume… Expand
An Improved Distributed Algorithm for Maximal Independent Set
TLDR
A very simple randomized algorithm providing a near-optimal local complexity of O(log deg(v) + log 1/e) rounds, with probability at least 1, which incidentally, when combined with some known techniques, also leads to a near -optimal global complexity. Expand
Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings
TLDR
These results show a separation between the complexity of the MIS problem (and of the maximal matching problem) on the one hand and the colouring problem on the other, in contrast to other models, in which MIS is at least as hard as colouring. Expand
Tight Analysis of Parallel Randomized Greedy MIS
TLDR
A high probability upper bound of O(log n) on the round complexity of this algorithm in general graphs is proved, and it is shown that parallel randomized greedy MIS is as fast as the celebrated algorithm of Luby. Expand
Tight Analysis of Parallel Randomized Greedy MIS
TLDR
A high probability upper bound of O(log n) on the round complexity of this algorithm in general graphs is proved and it is shown that parallel randomized greedy MIS is as fast as the celebrated algorithm of Luby. Expand
Tight Analysis of Randomized Greedy MIS
TLDR
A high probability upper bound of $O(\log n)$ on the round complexity of this algorithm in general graphs is proved, and it is shown that parallel randomized greedy MIS is as fast as the celebrated algorithm of Luby [STOC'85, JALG'86]. Expand
Fair Maximal Independent Sets
TLDR
A lower bound is identified that identifies a graph where all MIS algorithms achieve an inequality bound in Ω(n)-eliminating the possibility of an MIS algorithm that is fair in all graphs. Expand
The Locality of Distributed Symmetry Breaking
TLDR
New bounds on the locality of several classical symmetry breaking tasks in distributed networks are presented and a new technique for reducing symmetry breaking problems on low arboricity graphs to low degree graphs is introduced. Expand
Brief Announcement: Using Read-k Inequalities to Analyze a Distributed MIS Algorithm
TLDR
It is shown how to deal with dependencies induced by the recent tree MIS algorithms when they are executed on bounded arboricity graphs by using a new tail inequality for read-k families of random variables due to Gavinsky et al. Expand
Time-Optimal Construction of Overlay Networks
TLDR
Motivated by the idea that nodes possess two different modes of communication, a synchronous communication network in which nodes can send messages to nodes they know the identifier of and establish new connections by sending node identifiers is constructed. Expand
MIS on trees
TLDR
This paper presents a solution with randomized running time O(√log n log log n) on trees, improving roughly quadratically on the state-of-the-art bound, and does not rely on any bound on the number of independent neighbors. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 25 REFERENCES
A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem
TLDR
A technique due to A. Joffe (1974) is applied and deterministic construction in fast parallel time of various combinatorial objects whose existence follows from probabilistic arguments is obtained. Expand
Distributed coloring in Õ (√log n) Bit Rounds
TLDR
For the cycle in which all edges have the same orientation, it is shown that a simple randomized algorithm can achieve a 3-coloring with only O(√log n) rounds of bit transmissions, with high probability, and the bit complexity of coloring an oriented cycle is Ω( ∼log n), with high likelihood, no matter how many colors are allowed. Expand
The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case
In Moran and Warmuth (1993, SIAM .J. Comput.22, No. 2, 379-399), it was shown that computing any non-constant function on a ring of n of processors requires ?(n log) bits and this bound is tight.Expand
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
TLDR
This paper proposes a deterministic algorithm that computes a maximal independent set in time O(log Δ· log*n) in graphs with bounded growth, where n and Δ denote the number of nodes and the maximal degree in G, respectively. Expand
Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds
TLDR
This work considers the well-known vertex coloring problem: given a graph G, find a coloring of the vertices so that no two neighbors in G have the same color, and shows that for the n-node cycle the bit complexity of the coloring problem is Omega(log n). Expand
Locality in Distributed Graph Algorithms
  • N. Linial
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1992
TLDR
This model focuses on the issue of locality in distributed processing, namely, to what extent a global solution to a computational problem can be obtained from locally available data. Expand
On the complexity of distributed graph coloring
TLDR
This paper proves new strong lower bounds for two special kinds of coloring algorithms, and proves a time lower bound of Ω(Δ/log<sup>2</sup> Δ+ log*<i>m</i>) to obtain an <i>O</i>(Δ)-coloring. Expand
Network decomposition and locality in distributed computation
The authors introduce a concept of network decomposition, a partitioning of an arbitrary graph into small-diameter connected components, such that the graph created by contracting each component intoExpand
Bit complexity of breaking and achieving symmetry in chains and rings
TLDR
The communication costs of three well studied tasks: Consensus, Leader, and MaxF (finding the maximum identity) are investigated, and it is shown that in chain and ring topologies, the message complexities of all three tasks are the same. Expand
What can be computed locally?
TLDR
A study of computation that can be done locally in a distributed network, where \locally" means within time (or distance) independent of the size of the network, and results include Locally Checkable Labeling problems, where the legality of a labeling can be checked locally. Expand
...
1
2
3
...