PERFORMANCE CHARACTERIZATION OF THE TREE QUORUM ALGORITHM

標題:	PERFORMANCE CHARACTERIZATION OF THE TREE QUORUM ALGORITHM
作者:	CHANG, HK YUAN, SM 交大名義發表資訊工程學系 National Chiao Tung University Department of Computer Science
關鍵字:	DISTRIBUTED MUTUAL EXCLUSION;TREE QUORUM ALGORITHM;AVAILABILITY;COMMUNICATION COST
公開日期:	1-六月-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 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
期刊:	IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
Volume:	6
Issue:	6
起始頁:	658
結束頁:	662
顯示於類別：	期刊論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。