Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Increasing availability under mutual exclusion constraints with dynamic vote reassignment
ACM Transactions on Computer Systems (TOCS)
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)
Communications of the ACM
Failure detectors in omission failure environments
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
ACM Transactions on Computer Systems (TOCS)
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Non-blocking atomic commitment
Distributed systems (2nd Ed.)
IEEE Transactions on Software Engineering
Reliable Distributed Computing with the ISIS Toolkit
Reliable Distributed Computing with the ISIS Toolkit
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Consensus-Based Fault-Tolerant Total Order Multicast
IEEE Transactions on Parallel and Distributed Systems
Exploiting Atomic Broadcast in Replicated Databases
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Sequential Consistency in Distributed Systems
Selected Papers from the International Workshop on Theory and Practice in Distributed Systems
Online Reconfiguration in Replicated Databases Based on Group Communication
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
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
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Atomic Broadcast in Asynchronous Crash-Recovery Distributed Systems
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Failure detection and consensus in the crash-recovery model
Distributed Computing
Failure, connectivity and disconnection detectors
UbiMob '04 Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing
Advances in the design and implementation of group communication middleware
Dependable Systems
On detecting termination in the crash-recovery model
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Load Balancing to Increase the Consistency of Replicas in Data Grids
International Journal of Distributed Systems and Technologies
| Hi-index | 0.00 |
Atomic Broadcast is a fundamental problem of distributed systems: It states that messages must be delivered in the same order to their destination processes. This paper describes a solution to this problem in asynchronous distributed systems in which processes can crash and recover. A Consensus-based solution to Atomic Broadcast problem has been designed by Chandra and Toueg for asynchronous distributed systems where crashed processes do not recover. We extend this approach: It transforms any Consensus protocol suited to the crash-recovery model into an Atomic Broadcast protocol suited to the same model. We show that Atomic Broadcast can be implemented requiring few additional log operations in excess of those required by the Consensus. The paper also discusses how additional log operations can improve the protocol in terms of faster recovery and better throughput. To illustrate the use of the protocol, the paper also describes a solution to the replica management problem in asynchronous distributed systems in which processes can crash and recover. The proposed technique makes a bridge between established results on Weighted Voting and recent results on the Consensus problem.