English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 60861/93527 (65%)
造訪人次 : 1507377      線上人數 : 9
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/118114


    題名: The Harmonized Consensus Protocol in Distributed Systems
    作者: Cheng, Chien-Fu;Huang, Chung-Wei
    關鍵詞: Distributed system;Fault-tolerant;Reliability;Consensus problem;Harmonized consensus protocol
    日期: 2019-08-22
    上傳時間: 2020-02-20 12:10:17 (UTC+8)
    出版者: Springer
    摘要: 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.
    關聯: The Journal of Supercomputing 75(11), p.7690-7722
    DOI: 10.1007/s11227-019-02970-y
    顯示於類別:[資訊工程學系暨研究所] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML82檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

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