14th International Conference on Distributed Computing Systems (1994)

Pozman, Poland

June 21, 1994 to June 24, 1994

ISBN: 0-8186-5840-1

pp: 76-80

Her-Kun Chang , Dept. of Comput. & Inf. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan

Shyan-Ming Yuan , Dept. of Comput. & Inf. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan

ABSTRACT

The tree quorum algorithm (TQA), which logically organizes the sites in a system into a tree, is an efficient and fault-tolerant solution for distributed mutual exclusion. Quorum size can be reduced to log N in the best case of TQA. In this paper, message complexity of TQA is analyzed. Moreover, it is shown that the ratio of message complexity to quorum size converges to 1/p, where p is the probability that a site is operational.<>

INDEX TERMS

communication complexity, distributed algorithms

CITATION

Her-Kun Chang and Shyan-Ming Yuan, "Message complexity of the tree quorum algorithm for distributed mutual exclusion,"

*14th International Conference on Distributed Computing Systems(ICDCS)*, Pozman, Poland, 1994, pp. 76-80.

doi:10.1109/ICDCS.1994.302395

CITATIONS