標題: An efficient communication structure for decentralized algorithms with fault tolerance
作者: Yuan, SM
Agrawala, AK
資訊工程學系
Department of Computer Science
關鍵字: distributed systems;decentralized algorithms;fault tolerance;consensus protocols;message complexity;communication structures
公開日期: 1-Nov-1997
摘要: 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.
URI: http://hdl.handle.net/11536/149709
ISSN: 0267-6192
期刊: COMPUTER SYSTEMS SCIENCE AND ENGINEERING
Volume: 12
起始頁: 343
結束頁: 349
Appears in Collections:Articles