Making randomized algorithms self-stabilizing
First published in
Number in series
Lecture Notes in Computer Science 11639 LNCS: 309-324 (2019-06)
Contribution to Conference
It is well known that the areas of self-stabilizing algorithms and local algorithms are closely related. Using program transformation techniques local algorithms can be made self-stabilizing, albeit an increase in run-time or memory consumption is often unavoidable. Unfortunately these techniques often do not apply to randomized algorithms, which are often simpler and faster than deterministic algorithms. In this paper we demonstrate that it is possible to take over ideas from randomized distributed algorithms to self-stabilizing algorithms. We present two simple self-stabilizing algorithms computing a maximal independent set and a maximal matching and terminate in the synchronous model with high probability in O(log n) rounds. The algorithms outperform all existing algorithms that do not rely on unique identifiers.