Unifying self-stabilization and fault-tolerance
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Closure and Convergence: A Foundation of Fault-Tolerant Computing
IEEE Transactions on Software Engineering - Special issue on software reliability
Self-stabilization by counter flushing
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Constructing 1-writer multireader multivalued atomic variables from regular variables
Journal of the ACM (JACM)
Hive: fault containment for shared-memory multiprocessors
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
A highly safe self-stabilizing mutual exclusion algorithm
Information Processing Letters
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Time-adaptive self stabilization
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Designing Masking Fault-Tolerance via Nonmasking Fault-Tolerance
IEEE Transactions on Software Engineering
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Self-Stabilizing Mutual Exclusion in the Presence of Faulty Nodes
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
A latency optimal superstabilizing mutual exclusion protocol in unidirectional rings
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Stabilizing Replicated Search Trees
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
A Composite Stabilizing Data Structure
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
How to Improve Safety under Convergence Using Stable Storage
IEEE Transactions on Parallel and Distributed Systems
Analysis of an Intentional Fault Which Is Undetectable by Local Checks under an Unfair Scheduler
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A 1-strong self-stabilizing transformer
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Algorithms and theory of computation handbook
Necessary and sufficient conditions for 1-adaptivity
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Loop-free super-stabilizing spanning tree construction
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Space-efficient fault-containment in dynamic networks
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
A superstabilizing protocol is a protocol that (i) is self-stabilizing, meaning that it can recover from an arbitrarily severe transient fault; and (ii) can recover from a local transient fault while satisfying a passage predicate during recovery. This paper investigates the possibility of superstabilizing protocols for mutual exclusion in a ring of processors, where a local fault consists of any transient fault at a single processor; the passage predicate specifies that there be at most one token in the ring, with the single exception of a spurious token colocated with the transient fault. The first result of the paper is an impossibility theorem for a class of superstabilizing mutual exclusion protocols. Two unidirectional protocols are then presented to show that conditions for impossibility can independently be relaxed so that superstabilization is possible using either additional time or communication registers. A bidirectional protocol subsequently demonstrates that superstabilization in O(1) time is possible. All three superstabilizing protocols are optimal with respect to the number of communication registers used.