An efficient communication structure for decentralized algorithms with fault tolerance
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
349 | en_US |
dc.citation.spage |
343 | en_US |
dc.citation.volume |
12 | en_US |
dc.citation.woscount |
0 | en_US |
dc.contributor.author |
Yuan, SM | en_US |
dc.contributor.author |
Agrawala, AK | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2019-04-02T05:58:41Z | |
dc.date.available |
2019-04-02T05:58:41Z | |
dc.date.issued |
1997-11-01 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.issn |
0267-6192 | en_US |
dc.identifier.journal |
COMPUTER SYSTEMS SCIENCE AND ENGINEERING | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/149709 | |
dc.identifier.wosnumber |
WOS:A1997YL62100001 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
distributed systems | en_US |
dc.subject |
decentralized algorithms | en_US |
dc.subject |
fault tolerance | en_US |
dc.subject |
consensus protocols | en_US |
dc.subject |
message complexity | en_US |
dc.subject |
communication structures | en_US |
dc.title |
An efficient communication structure for decentralized algorithms with fault tolerance | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文
引用此條目
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