Journal ArticleDOI
Bounded cost algorithms for multivalued consensus using binary consensus instances
Jialin Zhang,Wei Chen +1 more
Reads0
Chats0
TLDR
Two bounded cost algorithms that solve multivalued consensus using binary consensus instances, where [email protected]?About:
This article is published in Information Processing Letters.The article was published on 2009-08-01. It has received 26 citations till now. The article focuses on the topics: Consensus theorem & Bounded function.read more
Citations
More filters
Book
Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems
TL;DR: This book focuses on the main abstractions that one has to understand and master in order to be able to produce software with guaranteed properties, and relies on the failure detector approach, which is central to the book.
Posted Content
Convergence Speed of Binary Interval Consensus
Moez Draief,Milan Vojnovic +1 more
TL;DR: An upper bound on the expected convergence time that holds for arbitrary connected graphs, which is based on the location of eigenvalues of some contact rate matrices is derived, and insights are provided on how the expected converge time depends on the network topology.
Book
Fault-Tolerant Message-Passing Distributed Systems: An Algorithmic Approach
TL;DR: This book presents the most important fault-tolerant distributed programming abstractions and their associated distributed algorithms, in particular in terms of reliable communication and agreement, which lie at the heart of nearly all distributed applications.
Posted Content
(Leader/Randomization/Signature)-free Byzantine Consensus for Consortium Blockchains.
TL;DR: This paper revisits the consensus validity property by requiring that the decided value satisfies a predefined predicate, which does not systematically exclude a value proposed only by Byzantine processes, thereby generalizing the validity properties found in the literature.
Proceedings ArticleDOI
Convergence Speed of Binary Interval Consensus
Moez Draief,Milan Vojnoviae +1 more
TL;DR: An upper bound on the expected convergence time that holds for arbitrary connected graphs, which is based on the location of eigenvalues of some contact rate matrices is derived, and insights are provided on how the expected converge time depends on the network topology.
References
More filters
Journal ArticleDOI
Impossibility of distributed consensus with one faulty process
TL;DR: In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process.
Proceedings ArticleDOI
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
TL;DR: This work exhibits a probabilistic solution for this problem, which guarantees that as long as a majority of the processes continues to operate, a decision will be made (Theorem 1).
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
Vassos Hadzilacos,Sam Toueg +1 more
Journal ArticleDOI
Extending binary Byzantine agreement to multivalued Byzantine agreement
Russell Turpin,Brian A Coan +1 more
TL;DR: A binary Byzantine agreement algorithms can be extended to produce a multivalued Byzantine agreement algorithm that is cheaper than previously published algorithms when the cost of transmitting values from the multivaluing domain is significant.