1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorCHANG, HKen_US
dc.contributor.authorYUAN, SMen_US
dc.date.accessioned2014-12-08T15:03:21Z-
dc.date.available2014-12-08T15:03:21Z-
dc.date.issued1995-06-01en_US
dc.identifier.issn1045-9219en_US
dc.identifier.urihttp://dx.doi.org/10.1109/71.388047en_US
dc.identifier.urihttp://hdl.handle.net/11536/1898-
dc.description.abstractThe 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.isoen_USen_US
dc.subjectDISTRIBUTED MUTUAL EXCLUSIONen_US
dc.subjectTREE QUORUM ALGORITHMen_US
dc.subjectAVAILABILITYen_US
dc.subjectCOMMUNICATION COSTen_US
dc.titlePERFORMANCE CHARACTERIZATION OF THE TREE QUORUM ALGORITHMen_US
dc.typeNoteen_US
dc.identifier.doi10.1109/71.388047en_US
dc.identifier.journalIEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMSen_US
dc.citation.volume6en_US
dc.citation.issue6en_US
dc.citation.spage658en_US
dc.citation.epage662en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1995RB53600009-
dc.citation.woscount4-
Appears in Collections:Articles


Files in This Item:

  1. A1995RB53600009.pdf

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.

Related Contents
Loading...