Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
Distributed operating systems
A Fault-Tolerant Algorithm for Replicated Data Management
IEEE Transactions on Parallel and Distributed Systems
Replication, consistency, and practicality: are these mutually exclusive?
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
An Overview of the Arjuna Distributed Programming System
IEEE Software
Update propagation strategies to improve freshness in lazy master replicated databases
The VLDB Journal — The International Journal on Very Large Data Bases
Using Application Specific Knowledge for Configuring Object Replicas
ICCDS '96 Proceedings of the 3rd International Conference on Configurable Distributed Systems
Object Replication in Arjuna
Are quorums an alternative for data replication?
ACM Transactions on Database Systems (TODS)
Ganymed: scalable replication for transactional web applications
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Postgres-R(SI): Combining Replica Control with Concurrency Control Based on Snapshot Isolation
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
IEICE - Transactions on Information and Systems
Hi-index | 0.00 |
Existing solutions to improve availability and fault-tolerance of distributed systems suffer from extra added complications and overheads to these systems. Some of these solutions use object replication for achieving their objective and thus entail these overheads to control object replicas. This paper presents a similar solution, but uses a novel mechanism for the pessimistic control of object replicas, namely the primary server approach. The message overhead in this approach is considerably less than related solutions, leading to more improved system fault-tolerance and availability.