A belated proof of self-stabilization
Distributed Computing
An exercise in fault-containment: self-stabilizing leader election
Information Processing Letters
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Fault-containment in self-stabilizing distributed systems
Fault-containment in self-stabilizing distributed systems
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Selected writings on computing: a personal perspective
Selected writings on computing: a personal perspective
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Computers & Mathematics with Applications
Journal of Parallel and Distributed Computing
Timer-based composition of fault-containing self-stabilizing protocols
Information Sciences: an International Journal
ACM Transactions on Algorithms (TALG)
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
| Hi-index | 0.00 |
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.