On mutual exclusion in faulty distributed systems
Abdelmadjid Bouabdallah · ACM SIGOPS Operating Systems Review · 1994
In this paper, we present an extension of the fault-tolerant mutual exclusion algorithm of [1] to make it deadlock-free when a node requesting critical section or when a node executing its critical section fails. The proposed algorithm requires O (√ tn ) messages per critical section entry (in a network of n nodes) and O ( t √ tn ) messages when a node fails ( t − 1 is the upper bound of the node failures).