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.
|Number of pages||5|
|State||Published - 1 Dec 1994|
|Event||Proceedings of the 1994 IEEE 14th International Conference on Distributed Computing Systems - Poznan, Pol|
Duration: 21 Jun 1994 → 24 Jun 1994
|Conference||Proceedings of the 1994 IEEE 14th International Conference on Distributed Computing Systems|
|Period||21/06/94 → 24/06/94|