DocumentCode
3339228
Title
Self-stabilizing mutual exclusion in the presence of faulty nodes
Author
Buskens, R.W. ; Bianchini, R.P., Jr.
Author_Institution
Crawford Hill Lab., AT&T Bell Labs., Holmdel, NJ, USA
fYear
1995
fDate
27-30 June 1995
Firstpage
144
Lastpage
153
Abstract
The 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 online 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.<>
Keywords
distributed algorithms; self-adjusting systems; software fault tolerance; RatchetFT distributed fault tolerant mutual exclusion algorithm; correctness proof; faulty nodes; faulty processors; online failures; processor rings; self stabilizing mutual exclusion; self-stabilizing mutual exclusion; Automata; Fault tolerance; Sufficient conditions; System recovery; Terminology;
fLanguage
English
Publisher
ieee
Conference_Titel
Fault-Tolerant Computing, 1995. FTCS-25. Digest of Papers., Twenty-Fifth International Symposium on
Conference_Location
Pasadena, CA, USA
Print_ISBN
0-8186-7079-7
Type
conf
DOI
10.1109/FTCS.1995.466988
Filename
466988
Link To Document