<p><it>Abstract—</it>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.</p><p><it>Index Terms—</it>Distributed mutual exclusion, tree quorum algorithm, availability, communication cost.</p>

S. Yuan and H. Chang, "Performance Characterization of the Tree Quorum Algorithm," in IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 658-662, 1995.
doi:10.1109/71.388047