An efficient communication structure for decentralized algorithms with fault tolerance
檔案
本條目沒有附加檔案。
日期
1997-11-01
類型
系所
期刊名稱
COMPUTER SYSTEMS SCIENCE AND ENGINEERING
卷期與頁次
第 12 卷,頁 343–349
ISSN
0267-6192
語言
英文
摘要
Decentralized algorithms can be characterized by successive rounds of message interchanges. Several communication structures have been proposed to design decentralized algorithms such as diffusion computations, logically fully connected structures and neighbouring-set communication structures. In this paper, we present a new communication structure, called KDAMS, which can be used to design message and bit optimal decentralized algorithms for evaluating associative and commutative functions which include distributed transaction commitment and extrema finding. In addition, the KDAMS has the potential for easily imposing fault-tolerant mechanisms.
關鍵詞
distributed systemsdecentralized algorithmsfault toleranceconsensus protocolsmessage complexitycommunication structures所屬典藏
期刊論文引用此條目
Yuan, S., & Agrawala, A. (1997). An efficient communication structure for decentralized algorithms with fault tolerance. COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 12, 343–349. https://ir.lib.nycu.edu.tw/handle/11536/149709
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/149709