English  |  正體中文  |  简体中文  |  Items with full text/Total items : 56568/90363 (63%)
Visitors : 11873015      Online Users : 52
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/118114


    Title: The Harmonized Consensus Protocol in Distributed Systems
    Authors: Cheng, Chien-Fu;Huang, Chung-Wei
    Keywords: Distributed system;Fault-tolerant;Reliability;Consensus problem;Harmonized consensus protocol
    Date: 2019-08-22
    Issue Date: 2020-02-20 12:10:17 (UTC+8)
    Publisher: Springer
    Abstract: The goal of the consensus protocol is to make all non-faulty processors agree on a common value despite the interference of faulty processors. In the classical consen-sus problem, each processor can propose an initial-value and obtain a commonly agreed consensus value through message exchange. However, if the initial-value of any processor is shared by only a small number of other processors, this initial-value will not become the consensus value. This is because initial-values once determined cannot be changed in the classical consensus protocol. In this study, we propose a new consensus protocol named harmonized consensus protocol (HCP) to solve this problem. HCP has a mechanism that allows each processor to change its initial-value based on the messages it has collected during message exchange (i.e., PrfRule rules). Hence, it can increase the chances that all processors agree on a consensus value they prefer and accept. Moreover, HCP also has the mechanism for judging the sufficiency of messages collected (i.e., MajChk rule). It terminates message exchange when processors have collected enough messages for obtaining a consen-sus value. This also means that HCP can reduce the number of rounds of message exchanges and further lower the time and space complexity of reaching consensus. The performance evaluation results confirm that the proposed HCP can deliver a higher preference match rate with lower time and space complexity.
    Relation: The Journal of Supercomputing 75(11), p.7690-7722
    DOI: 10.1007/s11227-019-02970-y
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML17View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback