Full metadata record
DC FieldValueLanguage
dc.contributor.authorCHANG, HKen_US
dc.contributor.authorYUAN, SMen_US
dc.date.accessioned2014-12-08T15:04:02Z-
dc.date.available2014-12-08T15:04:02Z-
dc.date.issued1994-04-22en_US
dc.identifier.issn0020-0190en_US
dc.identifier.urihttp://dx.doi.org/10.1016/0020-0190(94)00012-3en_US
dc.identifier.urihttp://hdl.handle.net/11536/2532-
dc.description.abstractThe hierarchical quorum consensus (HQC) algorithm, which is a generalization of the standard quorum consensus algorithm for managing replicated data, can reduce the quorum size to N0.63. This paper analyzes the message complexity of HQC. Moreover, an asymptotic analysis on the ratio of the message complexity to the quorum size is presented. It is shown that the ratio converges to a constant.en_US
dc.language.isoen_USen_US
dc.subjectANALYSIS OF ALGORITHMSen_US
dc.subjectREPLICATED DATAen_US
dc.subjectHIERARCHICAL QUORUM CONSENSUSen_US
dc.subjectQUORUM SIZEen_US
dc.subjectMESSAGE COMPLEXITYen_US
dc.titleMESSAGE COMPLEXITY OF HIERARCHICAL QUORUM CONSENSUS ALGORITHMen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/0020-0190(94)00012-3en_US
dc.identifier.journalINFORMATION PROCESSING LETTERSen_US
dc.citation.volume50en_US
dc.citation.issue2en_US
dc.citation.spage69en_US
dc.citation.epage73en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1994NH75400003-
dc.citation.woscount1-
Appears in Collections:Articles


Files in This Item:

  1. A1994NH75400003.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.