Zeus: Locality-aware Distributed Transactions

04/03/2021
by   Antonios Katsarakis, et al.
0

State-of-the-art distributed in-memory datastores (FaRM, FaSST, DrTM) provide strongly-consistent distributed transactions with high performance and availability. Transactions in those systems are fully general; they can atomically manipulate any set of objects in the store, regardless of their location. To achieve this, these systems use complex distributed transactional protocols. Meanwhile, many workloads have a high degree of locality. For such workloads, distributed transactions are an overkill as most operations only access objects located on the same server – if sharded appropriately. In this paper, we show that for these workloads, a single-node transactional protocol combined with dynamic object re-sharding and asynchronously pipelined replication can provide the same level of generality with better performance, simpler protocols, and lower developer effort. We present Zeus, an in-memory distributed datastore that provides general transactions by acquiring all objects involved in the transaction to the same server and executing a single-node transaction on them. Zeus is fault-tolerant and strongly-consistent. At the heart of Zeus is a reliable dynamic object sharding protocol that can move 250K objects per second per server, allowing Zeus to process millions of transactions per second and outperform more traditional distributed transactions on a wide range of workloads that exhibit locality.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/04/2021

Invalidation-Based Protocols for Replicated Datastores

Distributed in-memory datastores underpin cloud applications that run wi...
research
05/10/2021

G-Tran: Making Distributed Graph Transactions Fast

Graph transaction processing raises many unique challenges such as rando...
research
11/05/2018

STAR: Scaling Transactions through Asymmetrical Replication

In this paper, we present STAR, a new distributed and replicated in-memo...
research
06/25/2020

Fast General Distributed Transactions with Opacity using Global Time

Transactions can simplify distributed applications by hiding data distri...
research
03/31/2023

Shirakami: A Hybrid Concurrency Control Protocol for Tsurugi Relational Database System

Modern real-world transactional workloads such as bills of materials or ...
research
10/04/2021

Weakly Durable High-Performance Transactions

Existing disk-based database systems largely fall into two categories – ...
research
07/23/2021

Highly Available Queue-oriented Speculative Transaction Processing

Deterministic database systems have received increasing attention from t...

Please sign up or login with your details

Forgot password? Click here to reset