Abstract
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).
Publisher
Association for Computing Machinery (ACM)
Reference7 articles.
1. An improvement of the Maekawa's mutual exclusion algorithm to make it fault-tolerant;Bouabdallah A.;Parallel Processing Letters,1992
2. Technical Correspondence
3. Time, clocks, and the ordering of events in a distributed system
4. A √N algorithm for mutual exclusion in decentralized systems
5. [
5
] Raynal M. "Algorithms for mutual exclusion" MIT press 1985 160 p. [5] Raynal M. " Algorithms for mutual exclusion " MIT press 1985 160 p.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献