Title: | PERFORMANCE CHARACTERIZATION OF THE TREE QUORUM ALGORITHM |
Authors: | CHANG, HK YUAN, SM 交大名義發表 資訊工程學系 National Chiao Tung University Department of Computer Science |
Keywords: | DISTRIBUTED MUTUAL EXCLUSION;TREE QUORUM ALGORITHM;AVAILABILITY;COMMUNICATION COST |
Issue Date: | 1-Jun-1995 |
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 peformance. Thus the refined tree performs better than the original. |
URI: | http://dx.doi.org/10.1109/71.388047 http://hdl.handle.net/11536/1898 |
ISSN: | 1045-9219 |
DOI: | 10.1109/71.388047 |
Journal: | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS |
Volume: | 6 |
Issue: | 6 |
Begin Page: | 658 |
End Page: | 662 |
Appears in Collections: | Articles |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.