Publication 1995 Issue No. 6 - June Abstract - Performance Characterization of the Tree Quorum Algorithm
Performance Characterization of the Tree Quorum Algorithm
June 1995 (vol. 6 no. 6)
pp. 658-662
 ASCII Text x Her-Kun Chang, Shyan-Ming Yuan, "Performance Characterization of the Tree Quorum Algorithm," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 6, pp. 658-662, June, 1995.
 BibTex x @article{ 10.1109/71.388047,author = {Her-Kun Chang and Shyan-Ming Yuan},title = {Performance Characterization of the Tree Quorum Algorithm},journal ={IEEE Transactions on Parallel and Distributed Systems},volume = {6},number = {6},issn = {1045-9219},year = {1995},pages = {658-662},doi = {http://doi.ieeecomputersociety.org/10.1109/71.388047},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Parallel and Distributed SystemsTI - Performance Characterization of the Tree Quorum AlgorithmIS - 6SN - 1045-9219SP658EP662EPD - 658-662A1 - Her-Kun Chang, A1 - Shyan-Ming Yuan, PY - 1995VL - 6JA - IEEE Transactions on Parallel and Distributed SystemsER -

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.

Index Terms—Distributed mutual exclusion, tree quorum algorithm, availability, communication cost.

[1] D. Agrawal and A.E. Abbadi, An Efficient and Fault-Tolerant Solution for Distributed Mutual Exclusion ACM Trans. Computing Systems, vol. 9, no. 1, pp. 1-20, 1991.
[2] H. Garcia-Molina and D. Barbara, “How to Assign Votes in a Distributed System,” J. ACM, vol. 32, no. 4, pp. 841-860, Oct. 1985.
[3] T. Ibaraki and T. Kameda,“A theory of coteries: Mutual exclusion in distributed systems,”IEEE Trans. Parallel Distrib. Syst.,vol. 4, pp. 779–794, 1993.
[4] M. Maekawa, “A$\sqrt N$Algorithm for Mutual Exclusion in Decentralized Systems,” ACM Trans. Computer Systems, vol. 3, no. 2, pp. 145-159, May 1985.
[5] M. L. Nelisen and M. Mizuno,“Coterie join algorithm,”IEEE Trans. Parallel Distrib. Syst.,vol. 3, pp. 582–590, 1992.
[6] M. Raynal, Algorithms for Mutual Exclusion. NorthOxford Academic, 1986.
[7] ——,“A simple taxonomy for distributed mutual exclusion algorithms,”Oper. Syst. Rev.,vol. 25, no. 2, pp. 47–50, 1991.
[8] G. Ricart and A. K. Agrawala,“An optimal algorithm for mutual exclusion in computer networks,”Commun. ACM,vol. 5, no. 3, pp. 284–299, 1987.
[9] B. A. Sanders,“The information structure of distributed mutual exclusion algorithms,”ACM Trans. Comput. Syst.,vol. 24, no. 1, pp. 9–17, 1981.
[10] I. Suzuki and T. Kasami,“A distributed mutual exclusion algorithm,”ACM Trans. Comput. Syst.,vol. 5, no. 3, pp. 284–299, 1987.
[11] R.H. Thomas, “A Majority Consensus Approach to Concurrency Control,” ACM Trans. Database Systems, vol. 4, no. 2, pp. 180-209, June 1979.

Citation:
Her-Kun Chang, Shyan-Ming Yuan, "Performance Characterization of the Tree Quorum Algorithm," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 6, pp. 658-662, June 1995, doi:10.1109/71.388047