10 search results - page 2 / 2 » Optimistically Terminating Consensus: All Asynchronous Conse... |
WDAG
2005
Springer
14 years 1 months ago
2005
Springer
Atomic Broadcast, used for example in state machine replication, requires three communication steps. Optimistic Atomic Broadcast requires only two steps if all processes receive m...
OPODIS
2007
13 years 9 months ago
2007
This paper tackles the consensus problem in asynchronous systems prone to byzantine failures. One way to circumvent the FLP impossibility result consists in adding synchrony assump...
PODC
2004
ACM
14 years 1 months ago
2004
ACM
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...
ICDE
1991
IEEE
13 years 11 months ago
1991
IEEE
Voting protocols ensure the consistency of replicated objects by requiring all read and write requests to collect an appropriate quorum of replicas. We propose to replace some of ...
ICFEM
2009
Springer
14 years 2 months ago
2009
Springer
Fault-tolerant (FT) distributed protocols (such as group membership, consensus, etc.) represent fundamental building blocks for many practical systems, e.g., the Google File System...