Self-Stabilizing Mutual Exclusion in the Presence of Faulty Nodes

Authors:
Richard Buskens;Ronald Bianchini Jr
Affiliations:
-;-
Venue:
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Year:
1995

Citing 16
Cited 1

The mutual exclusion problem: part I—a theory of interprocess communication

Journal of the ACM (JACM)
The mutual exclusion problem: partII—statement and solutions

Journal of the ACM (JACM)
A belated proof of self-stabilization

Distributed Computing
Uniform self-stabilizing rings

ACM Transactions on Programming Languages and Systems (TOPLAS)
Token Systems That Self-Stabilize

IEEE Transactions on Computers
A synchronization algorithm for processes with dynamic priorities in computer networks with node failures

Information Processing Letters
Self-stabilization

ACM Computing Surveys (CSUR)
The consensus problem in fault-tolerant computing

ACM Computing Surveys (CSUR)
Unifying self-stabilization and fault-tolerance

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Practical on-line diagnosis in distributed systems

Practical on-line diagnosis in distributed systems
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Reaching Approximate Agreement with Mixed-Mode Faults

IEEE Transactions on Parallel and Distributed Systems
Stabilization and Pseudo-Stabilization

Stabilization and Pseudo-Stabilization
Self-stabilization: randomness to reduce space

Distributed Computing
A self-adjusting algorithm for byzantine agreement

Distributed Computing

Superstabilizing mutual exclusion

Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the RatchetFT distributed fault-tolerant mutual exclusion algorithm for processor rings. RatchetFT is self-stabilizing, in that if mutual exclusion is lost due to any sequence of on-line failures and repairs of processors, mutual exclusion will eventually be regained. This research demonstrates that self-stabilization can be achieved in the presence of faulty processors, provided that these faulty processors always appear to behave incorrectly. Self-stabilization is achievable even if faulty processor behavior is not restricted to transient failures or other simple failure models. The key results of the paper include the specification of RatchetFT and a detailed sketch of its correctness proof.