The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—An independent set is a useful structure because, in some situations, it defines a set of mutually compatible operations, i.e., operations that can be executed simultaneously. In this paper, we design a fault-containing self-stabilizing algorithm that finds a maximal independent set for an asynchronuous distributed system. Our algorithm is an improvement on the self-stabilizing algorithm in Shukla et al.. In the single-fault situation, the worst-case stabilization time of Shukla's algorithm is \Omega(n), where n is the number of nodes in the system, whereas the worst-case stabilization time of our algorithm is O(\Delta), where \Delta is the maximum node degree in the system. Compared also with the fault-containing algorithm that is induced from applying the general transformer in Ghosh et al. to Shukla's algorithm, our algorithm is also seen to be faster in stabilization time, in the single-fault situation. Therefore, our algorithm can be considered to be the most efficient fault-containing self-stabilizing algorithm for the maximal independent set finding up to this point.</p>
Central demon, maximal independent set, single transient fault, fault-containment, restrictions on guard conditions, primary variables, auxiliary secondary variables, stabilization time, contamination number.

T. C. Huang and J. Lin, "An Efficient Fault-Containing Self-Stabilizing Algorithm for Finding a Maximal Independent Set," in IEEE Transactions on Parallel & Distributed Systems, vol. 14, no. , pp. 742-754, 2003.
82 ms
(Ver 3.3 (11022016))