Peepco: Batch-Based Consistency Optimization
Ivan Kuraj, John K. Feser, Nadia Polikarpova, Armando Solar-Lezama
Abstract
We present batch-based consistency, a new approach for consistency optimization that allows programmers to specialize consistency with application-level integrity properties. We implement the approach with a two-step process: we statically infer optimal consistency requirements for executions of bounded sets of operations, and then, use the inferred requirements to parameterize a new distributed protocol to relax operation reordering at run time when it is safe to do so. Our approach supports standard notions of consistency. We implement batch-based consistency in Peepco , demonstrate its expressiveness for partial data replication, and examine Peepco’s run-time performance impact in different settings.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 3b72d10f-485d-4f1a-917a-7098c4236171Related papers
- Epoch-based Commit and Replication in Distributed OLTP DatabasesYi Lu, Xiangyao Yu, Lei Cao, Samuel MaddenVLDB 2021 · 52 citations
- HeteroGen: Automatic Synthesis of Heterogeneous Cache Coherence ProtocolsNicolai Oswald, Vijay Nagarajan, Daniel J. Sorin, Vasilis Gavrielatos et al.HPCA 2022 · 15 citations
- Optimizing Distributed Protocols with Query RewritesDavid C. Y. Chu, Rithvik Panchapakesan, Shadaj Laddad, Lucky E. Katahanas et al.SIGMOD 2024 · 6 citations
- Frashokereti: Non-aborting Optimistically Replicated ObjectsEric Man Chan, Javad Saberlatibari, Mohsen LesaniOOPSLA 2026
- Hampa: Solver-Aided Recency-Aware ReplicationXiao Li, Farzin Houshmand, Mohsen LesaniCAV 2020 · 6 citations
