Performance Characterization of the Tree Quorum Algorithm

Her Kun Chang; Shy an Ming Yuan

doi:10.1109/71.388047

Performance Characterization of the Tree Quorum Algorithm

Her Kun Chang, Shy an Ming Yuan

National Yang Ming Chiao Tung University

Research output: Contribution to journal › Journal Article › peer-review

4 Scopus citations

Abstract

The tree quorum algorithm, which logically organizes the sites in a system to a tree structure, is an efficient and fault-tolerant solution for distributed mutual exclusion. In this paper, the performance characteristics of the tree quorum algorithm is analyzed. A refinement algorithm is proposed to refine a logical tree structure by eliminating nodes or subtrees which do not improve the performance. Thus the refined tree performs better than the original.

Original language	English
Pages (from-to)	658-662
Number of pages	5
Journal	IEEE Transactions on Parallel and Distributed Systems
Volume	6
Issue number	6
DOIs	https://doi.org/10.1109/71.388047
State	Published - 06 1995
Externally published	Yes

Keywords

Distributed mutual exclusion
availability
communication cost
tree quorum algorithm

Access to Document

10.1109/71.388047

Cite this

@article{fe42b766c758499ca5199c3de618c998,

title = "Performance Characterization of the Tree Quorum Algorithm",

abstract = "The tree quorum algorithm, which logically organizes the sites in a system to a tree structure, is an efficient and fault-tolerant solution for distributed mutual exclusion. In this paper, the performance characteristics of the tree quorum algorithm is analyzed. A refinement algorithm is proposed to refine a logical tree structure by eliminating nodes or subtrees which do not improve the performance. Thus the refined tree performs better than the original.",

keywords = "Distributed mutual exclusion, availability, communication cost, tree quorum algorithm",

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

year = "1995",

month = jun,

doi = "10.1109/71.388047",

language = "英语",

volume = "6",

pages = "658--662",

journal = "IEEE Transactions on Parallel and Distributed Systems",

issn = "1045-9219",

publisher = "IEEE Computer Society",

number = "6",

}

TY - JOUR

T1 - Performance Characterization of the Tree Quorum Algorithm

AU - Chang, Her Kun

AU - Yuan, Shy an Ming

PY - 1995/6

Y1 - 1995/6

N2 - The tree quorum algorithm, which logically organizes the sites in a system to a tree structure, is an efficient and fault-tolerant solution for distributed mutual exclusion. In this paper, the performance characteristics of the tree quorum algorithm is analyzed. A refinement algorithm is proposed to refine a logical tree structure by eliminating nodes or subtrees which do not improve the performance. Thus the refined tree performs better than the original.

AB - The tree quorum algorithm, which logically organizes the sites in a system to a tree structure, is an efficient and fault-tolerant solution for distributed mutual exclusion. In this paper, the performance characteristics of the tree quorum algorithm is analyzed. A refinement algorithm is proposed to refine a logical tree structure by eliminating nodes or subtrees which do not improve the performance. Thus the refined tree performs better than the original.

KW - Distributed mutual exclusion

KW - availability

KW - communication cost

KW - tree quorum algorithm

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

U2 - 10.1109/71.388047

DO - 10.1109/71.388047

M3 - 文章

AN - SCOPUS:0029327915

SN - 1045-9219

VL - 6

SP - 658

EP - 662

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

IS - 6

ER -

Performance Characterization of the Tree Quorum Algorithm

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this