CORC  > 清华大学
Bounded cost algorithms for multivalued consensus using binary consensus instances
Zhang, Jialin ; Chen, Wei
2010-10-12 ; 2010-10-12
关键词Distributed computing Fault tolerance Binary consensus Multivalued consensus Computer Science, Information Systems
中文摘要In this paper, we present two bounded cost algorithms that solve multivalued consensus using binary consensus instances. Our first algorithm uses [log(2) n] number of binary consensus instances where n is the number of processes, while our second algorithm uses at most 2 (k) over tilde binary consensus instances, where V is the maximum length of the binary representation of all proposed values in the run. Both algorithms are significant improvements over the previous algorithm in [A. Mostefaoui, M. Raynal, F. Tronel, From binary consensus to multivalued consensus in asynchronous message-passing systems, Information Processing Letters 73 (5-6) (2000) 207-212], where the number of binary consensus instances needed to solve one multivalued consensus is unbounded. (C) 2009 Elsevier B.V. All rights reserved.
语种英语 ; 英语
出版者ELSEVIER SCIENCE BV ; AMSTERDAM ; PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
内容类型期刊论文
源URL[http://hdl.handle.net/123456789/78719]  
专题清华大学
推荐引用方式
GB/T 7714
Zhang, Jialin,Chen, Wei. Bounded cost algorithms for multivalued consensus using binary consensus instances[J],2010, 2010.
APA Zhang, Jialin,&Chen, Wei.(2010).Bounded cost algorithms for multivalued consensus using binary consensus instances..
MLA Zhang, Jialin,et al."Bounded cost algorithms for multivalued consensus using binary consensus instances".(2010).
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace