Message complexity of the tree quorum algorithm for distributed mutual exclusion

Her Kun Chang; Shyan Ming Yuan

Message complexity of the tree quorum algorithm for distributed mutual exclusion

Her Kun Chang^*
, Shyan Ming Yuan

^*Corresponding author for this work

National Yang Ming Chiao Tung University

Research output: Contribution to conference › Conference Paper › peer-review

3 Scopus citations

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.

Original language	English
Pages	76-80
Number of pages	5
State	Published - 1994
Externally published	Yes
Event	Proceedings of the 1994 IEEE 14th International Conference on Distributed Computing Systems - Poznan, Pol Duration: 21 06 1994 → 24 06 1994

Conference

Conference	Proceedings of the 1994 IEEE 14th International Conference on Distributed Computing Systems
City	Poznan, Pol
Period	21/06/94 → 24/06/94

Cite this

@conference{aec303be973b4178bfd315ae10a1084f,

title = "Message complexity of the tree quorum algorithm for distributed mutual exclusion",

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.",

author = "Chang, \{Her Kun\} and Yuan, \{Shyan Ming\}",

year = "1994",

language = "英语",

pages = "76--80",

note = "Proceedings of the 1994 IEEE 14th International Conference on Distributed Computing Systems ; Conference date: 21-06-1994 Through 24-06-1994",

}

TY - CONF

T1 - Message complexity of the tree quorum algorithm for distributed mutual exclusion

AU - Chang, Her Kun

AU - Yuan, Shyan Ming

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0028608716

M3 - 论文

AN - SCOPUS:0028608716

SP - 76

EP - 80

T2 - Proceedings of the 1994 IEEE 14th International Conference on Distributed Computing Systems

Y2 - 21 June 1994 through 24 June 1994

ER -

Message complexity of the tree quorum algorithm for distributed mutual exclusion

Abstract

Conference

Other files and links

Fingerprint

Cite this