A O(log/sub 2/ n) fault-tolerant distributed mutual exclusion algorithm based on open-cube structure
14th International Conference on Distributed Computing Systems (1994)
June 21, 1994 to June 24, 1994
J.M. Helary , IRISA, Rennes, France
A. Mostefaoui , IRISA, Rennes, France
A new distributed mutual exclusion algorithm, using a token and based upon an original rooted tree structure, is presented. The rooted tree introduced, named "open-cube", has noteworthy stability and locality properties, allowing the proposed algorithm to achieve good performances and high tolerance to node failures: the worst case message complexity per request is, in the absence of node failures, log/sub 2/n+1 where n is the number of nodes, whereas O(log/sub 2/n) extra messages in the average are necessary to tolerate each node failure. This algorithm is a particular instance of a general scheme for token and tree-based distributed mutual exclusion algorithms, previously presented in part by the authors; consequently, its safety and liveness properties are inherited from the general one.<
distributed algorithms, fault tolerant computing, software reliability, communication complexity, failure analysis, reliability theory
J. Helary and A. Mostefaoui, "A O(log/sub 2/ n) fault-tolerant distributed mutual exclusion algorithm based on open-cube structure," 14th International Conference on Distributed Computing Systems(ICDCS), Pozman, Poland, 1994, pp. 89-96.