Scaling Out Acid Applications with Operation Partitioning
Habib Saissi, Marco Serafini, Neeraj Suri

TL;DR
This paper introduces Operation Partitioning, a novel approach that enables scalable, ACID-compliant OLTP applications by partitioning operations rather than data, using static analysis and a lock-free protocol, demonstrated with significant performance improvements.
Contribution
It proposes Operation Partitioning, a new paradigm for scaling OLTP applications that maintains ACID guarantees through operation-based partitioning and a lock-free coordination protocol.
Findings
Up to 4.2x increase in throughput
Latency reduced by up to 58.6x
Stronger serializability guarantees
Abstract
OLTP applications with high workloads that cannot be served by a single server need to scale out to multiple servers. Typically, scaling out entails assigning a different partition of the application state to each server. But data partitioning is at odds with preserving the strong consistency guarantees of ACID transactions, a fundamental building block of many OLTP applications. The more we scale out and spread data across multiple servers, the more frequent distributed transactions accessing data at different servers will be. With a large number of servers, the high cost of distributed transactions makes scaling out ineffective or even detrimental. In this paper we propose Operation Partitioning, a novel paradigm to scale out OLTP applications that require ACID guarantees. Operation Partitioning indirectly partitions data across servers by partitioning the application's operations…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Cloud Computing and Resource Management · Distributed and Parallel Computing Systems
