Peepco: Batch-Based Consistency Optimization
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.
Authors
- John Feser (ORCID: https://orcid.org/0000-0001-8577-1784)
- Armando Solar-Lezama (ORCID: https://orcid.org/0000-0001-7604-8252)
- Ivan Kuraj
- Nadia Polikarpova (ORCID: https://orcid.org/0000-0001-5571-173X)
Institutions
- University of California San Diego (US)
- BASIS International (United States) (US)
- Massachusetts Institute of Technology (US)
Publication Details
- Journal
- Proceedings of the ACM on Programming Languages
- Published
- 2025-04-09
- DOI
- https://doi.org/10.1145/3720513
- Primary Topic
- Distributed systems and fault tolerance
- Type
- article
- Field-Weighted Citation Impact
- 0.00