DocumentCode
788772
Title
Performance characterization of the tree quorum algorithm
Author
Chang, Her-kun ; Yuan, Shyan-Ming
Author_Institution
Dept. of Comput. & Inf. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan
Volume
6
Issue
6
fYear
1995
fDate
6/1/1995 12:00:00 AM
Firstpage
658
Lastpage
662
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
Keywords
distributed algorithms; tree data structures; distributed mutual exclusion; fault-tolerant solution; logical tree structure; performance characteristics; performance characterization; refinement algorithm; tree quorum algorithm; tree structure; Algorithm design and analysis; Availability; Centralized control; Computer networks; Costs; Decision making; Distributed algorithms; Fault tolerant systems; Performance analysis; Tree data structures;
fLanguage
English
Journal_Title
Parallel and Distributed Systems, IEEE Transactions on
Publisher
ieee
ISSN
1045-9219
Type
jour
DOI
10.1109/71.388047
Filename
388047
Link To Document