Performance characterization of the tree quorum algorithm
Her-Kun Chang, Shyan‐Ming Yuan · IEEE Transactions on Parallel and Distributed Systems · 1995
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.>