Recommendations
- scientific article; zbMATH DE number 1263990
- Optimal deployment of eventually-serializable data services
- On serializability
- Serializability for eventual consistency: criterion, analysis, and applications
- scientific article; zbMATH DE number 4182805
- scientific article; zbMATH DE number 3965471
- Serializability theory for replicated databases
- Universally serializable computation
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 4110131 (Why is no real title available?)
- Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres
- Forward and backward simulations. I. Untimed Systems
- Forward and backward simulations. II: Timing-based systems
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
Cited in
(16)- scientific article; zbMATH DE number 1263990 (Why is no real title available?)
- A technique for constructing highly available services
- \textsc{Hampa}: solver-aided recency-aware replication
- Optimal deployment of eventually-serializable data services
- Efficient replication of large data objects
- Dynamic input/output automata: a formal and compositional model for dynamic systems
- The weakest failure detector for eventual consistency
- Long-lived RAMBO: trading knowledge for communication
- X-ability: a theory of replication
- Limitations of highly-available eventually-consistent data stores
- On the refinement of liveness properties of distributed systems
- Synthesis of large dynamic concurrent programs from dynamic specifications
- From sequential specifications to eventual consistency
- X-ability, a theory of replication
- Eventually consistent transactions
- Finite-state concurrent programs can be expressed in pairwise normal form
This page was built for publication: Eventually-serializable data services
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292429)
