PERFORMANCE CHARACTERIZATION OF THE TREE QUORUM ALGORITHM

Authors
CHANG HK YUAN SM
Citation
Hk. Chang et Sm. Yuan, PERFORMANCE CHARACTERIZATION OF THE TREE QUORUM ALGORITHM, IEEE transactions on parallel and distributed systems, 6(6), 1995, pp. 658-662
Citations number
11
Categorie Soggetti
System Science","Engineering, Eletrical & Electronic","Computer Science Theory & Methods
Journal title
IEEE transactions on parallel and distributed systems → ACNP
ISSN journal
10459219
Volume
6
Issue
6
Year of publication
1995
Pages
658 - 662
Database
ISI
SICI code
1045-9219(1995)6:6<658:PCOTTQ>2.0.ZU;2-A
Abstract
The tree quorum algorithm, which logically organizes the sites in a sy stem to a tree structure, is an efficient and fault-tolerant solution for distributed mutual exclusion. In this paper, the performance chara cteristics of the tree quorum algorithm is analyzed. A refinement algo rithm is proposed to refine a logical tree structure by eliminating no des or subtrees which do not improve the peformance. Thus the refined tree performs better than the original.