Sciweavers

17 search results - page 3 / 4
» A Leader-Free Byzantine Consensus Algorithm
Sort
View
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
13 years 11 months ago
Brief Announcement: A Leader-free Byzantine Consensus Algorithm
Fatemeh Borran, André Schiper
PODC
2004
ACM
13 years 11 months ago
Byzantine disk paxos: optimal resilience with byzantine shared memory
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...
ISPDC
2006
IEEE
14 years 11 days ago
Optimistically Terminating Consensus: All Asynchronous Consensus Protocols in One Framework
Optimistically Terminating Consensus (OTC) is a variant of Consensus that decides if all correct processes propose the same value. It is surprisingly easy to implement: processes ...
Piotr Zielinski
CISS
2008
IEEE
14 years 25 days ago
The Chinese Generals Problem
Abstract—To achieve higher reliability, safety, and faulttolerance, many mission-critical detection and decision systems implement consensus algorithms that force the systems’ ...
Edwin Soedarmadji
WDAG
2007
Springer
79views Algorithms» more  WDAG 2007»
14 years 14 days ago
A Simple Population Protocol for Fast Robust Approximate Majority
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
Dana Angluin, James Aspnes, David Eisenstat