PERFORMANCE CHARACTERIZATION OF THE TREE QUORUM ALGORITHM

doi:10.1109/71.388047

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	CHANG, HK	en_US
dc.contributor.author	YUAN, SM	en_US
dc.date.accessioned	2014-12-08T15:03:21Z	-
dc.date.available	2014-12-08T15:03:21Z	-
dc.date.issued	1995-06-01	en_US
dc.identifier.issn	1045-9219	en_US
dc.identifier.uri	http://dx.doi.org/10.1109/71.388047	en_US
dc.identifier.uri	http://hdl.handle.net/11536/1898	-
dc.description.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.	en_US
dc.language.iso	en_US	en_US
dc.subject	DISTRIBUTED MUTUAL EXCLUSION	en_US
dc.subject	TREE QUORUM ALGORITHM	en_US
dc.subject	AVAILABILITY	en_US
dc.subject	COMMUNICATION COST	en_US
dc.title	PERFORMANCE CHARACTERIZATION OF THE TREE QUORUM ALGORITHM	en_US
dc.type	Note	en_US
dc.identifier.doi	10.1109/71.388047	en_US
dc.identifier.journal	IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS	en_US
dc.citation.volume	6	en_US
dc.citation.issue	6	en_US
dc.citation.spage	658	en_US
dc.citation.epage	662	en_US
dc.contributor.department	交大名義發表	zh_TW
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	National Chiao Tung University	en_US
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1995RB53600009	-
dc.citation.woscount	4	-
顯示於類別：	期刊論文

文件中的檔案：

A1995RB53600009.pdf

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