Full metadata record
DC FieldValueLanguage
dc.contributor.authorYuan, SMen_US
dc.contributor.authorAgrawala, AKen_US
dc.date.accessioned2014-12-08T15:01:22Z-
dc.date.available2014-12-08T15:01:22Z-
dc.date.issued1997-11-01en_US
dc.identifier.issn0267-6192en_US
dc.identifier.urihttp://hdl.handle.net/11536/232-
dc.description.abstractDecentralized 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.language.isoen_USen_US
dc.subjectdistributed systemsen_US
dc.subjectdecentralized algorithmsen_US
dc.subjectfault toleranceen_US
dc.subjectconsensus protocolsen_US
dc.subjectmessage complexityen_US
dc.subjectcommunication structuresen_US
dc.titleAn efficient communication structure for decentralized algorithms with fault toleranceen_US
dc.typeArticleen_US
dc.identifier.journalCOMPUTER SYSTEMS SCIENCE AND ENGINEERINGen_US
dc.citation.volume12en_US
dc.citation.issue6en_US
dc.citation.spage343en_US
dc.citation.epage349en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
Appears in Collections:Articles