Frashokereti: Non-aborting Optimistically Replicated Objects
Optimistic replication of objects avoids coordination and brings higher responsiveness and availability. However, when clients issue concurrent operations, conflicts naturally arise which can lead the replicated states to diverge or lose integrity. When conflicts occur, existing approaches resort to pessimism or abortion. This paper characterizes ORDTs (Optimistically Replicated Data Types), objects that can be optimistically replicated with convergence and integrity, and without aborting calls. It shows that ORDTs subsume CRDTs and transformed relational schema, and presents techniques to convert objects to ORDTs. It further proves that optimistic replication for objects that fall out of ORDTs is aborting and NP-Complete. Further, it presents an optimistic replication protocol for ORDTs called Frashokereti.It uses a statically decided order to efficiently order calls. The paper proves that Frashokereti is sound for every ORDT, i.e., Frashokereti is optimistic and non-aborting, and preserves convergence, integrity, and liveness properties. Experimental results show that Frashokereti significantly outperforms previous optimistic protocols.
Mon 5 OctDisplayed time zone: Pacific Time (US & Canada) change
13:30 - 15:00 | Distributed and Replicated SystemsOOPSLA at East Hall 1 Chair(s): Mohsen Lesani University of California at Santa Cruz | ||
13:30 18mTalk | Frashokereti: Non-aborting Optimistically Replicated Objects OOPSLA Eric Man Chan University of California at Riverside, Javad Saberlatibari University of California at Riverside, Mohsen Lesani University of California at Santa Cruz DOI | ||
13:48 18mTalk | PRDTs: Composable Design and Verification of Consensus Protocols using Replicated Data Types OOPSLA Julian Haas Technische Universität Darmstadt, Ragnar Mogk Technische Universität Darmstadt, Annette Bieniusa Rheinland-Pfälzische Technische Universität Kaiserslautern-Landau, Mira Mezini Technische Universität Darmstadt; ATHENE; hessian.AI DOI Pre-print | ||
14:06 18mTalk | Relight: Simple User-Level Checkpointing and Fast-Forward Replay for Distributed Task-Based Systems OOPSLA Elliott Slaughter SLAC National Accelerator Laboratory, Rupanshu Soi Stanford University, Michael Bauer NVIDIA Research, Alex Aiken Stanford University DOI | ||
14:24 18mTalk | Composing CRDTs Convergent by Construction OOPSLA Alexander Städing Dominguez University of St. Gallen, George Zakhour University of St. Gallen, Pascal Weisenburger University of St. Gallen, Guido Salvaneschi University of St. Gallen DOI Pre-print | ||
14:42 18mTalk | Augur: Predicting View Serializability Violations in Relational Data Store Applications OOPSLA Chujun Geng Ohio State University, Noah Charlton Ohio State University, Spyros Blanas Ohio State University, Michael D. Bond Ohio State University, Yang Wang Ohio State University DOI | ||