Peepco: Batch-Based Consistency Optimization
Author(s)
Kuraj, Ivan; Feser, John; Polikarpova, Nadia; Solar-Lezama, Armando
Download3720513.pdf (1.324Mb)
Publisher with Creative Commons License
Publisher with Creative Commons License
Creative Commons Attribution
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2025-04-09Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence LaboratoryJournal
Proceedings of the ACM on Programming Languages
Publisher
ACM
Citation
Ivan Kuraj, John Feser, Nadia Polikarpova, and Armando Solar-Lezama. 2025. Peepco: Batch-Based Consistency Optimization. Proc. ACM Program. Lang. 9, OOPSLA1, Article 119 (April 2025), 29 pages.
Version: Final published version
ISSN
2475-1421