Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Towards a theory of replicated processing
Proceedings of a Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Replication management using the state-machine approach
Distributed systems (2nd Ed.)
Distributed systems (2nd Ed.)
The serializability of concurrent database updates
Journal of the ACM (JACM)
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Implementing e-Transactions with Asynchronous Replication
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Designing Distributed Services Using Refinement Mappings
Designing Distributed Services Using Refinement Mappings
Handling Emergent Nondeterminism in Replicated Services
Architecting Dependable Systems V
Living with nondeterminism in replicated middleware applications
Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware
Elastic SI-Cache: consistent and scalable caching in multi-tier architectures
The VLDB Journal — The International Journal on Very Large Data Bases
Living with nondeterminism in replicated middleware applications
Middleware'06 Proceedings of the 7th ACM/IFIP/USENIX international conference on Middleware
A constraint-based formalism for consistency in replicated systems
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
Different replication mechanisms provide different solutions to the same basic problem. However, there is no precise specification of the problem itself, only of particular classes of solutions, such as active replication and primary-backup. Having a precise specification of the problem would help us better understand the space of possible solutions.We present a formal definition of the problem solved by replication in the form of a correctness criterion called x-ability (exactly-once ability). An x-able service has obligations to its environment and its clients. It must update its environment under exactly-once semantics. Furthermore, it must provide idempotent, non-blocking request processing and deliver consistent results to its clients. X-ability is a local property: replicated services can be specified and implemented independently, and later composed in the implementation of more complex replicated services.