Providing high availability using lazy replication
ACM Transactions on Computer Systems (TOCS)
Sequential consistency versus linearizability
ACM Transactions on Computer Systems (TOCS)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Non-blocking atomic commitment
Distributed systems (2nd Ed.)
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Failure Detection and Consensus in the Crash-Recovery Model
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Exploiting Atomic Broadcast in Replicated Databases
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Consensus in Asynchronous Systems Where Processes Can Crash and Recover
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Atomic Broadcast in Asynchronous Crash-Recovery Distributed Systems
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
| Hi-index | 0.00 |
This paper describes a solution to the replica management problem in asynchronous distributed systems in which processes can crash and recover. Our solution is based on an Atomic Broadcast primitive which, in turn, is based on an underlying Consensus algorithm. The proposed technique makes a bridge between established results on Weighted Voting and recent results on the Consensus problem.