Ordering transactions with prediction in distributed object stores

Ittay Eyal, Ken Birman, Idit Keidar, Robbert Van Renesse

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In cloud-scale datacenters, it is common to shard
(partition) data across large numbers of nodes.
Atomic transactions are typically implemented
by running transactions speculatively, and then
certifying them, aborting ones that cause conflicts. However, in high contention scenarios, this
approach has drawbacks: rather than achieving
any substantial level of concurrency, it prevents
concurrency by aborting all but one of the contending transactions.
Our work explores a new option. We employ prediction, ordering transactions in advance based on the objects they are likely to access, providing ACID transactions in a Resilient
Archive with Independent Nodes (ACID-RAIN).
This preliminary ordering decreases abort rate,
and eliminates aborts in error-free executions.
To allow fast recovery from failures our scheme
does not introduce any locks. The system consistency and durability rely on a single scalable
tier of highly-available independent logs. Simulations using the Transactional-YCSB workloads show the scalability and benefits of ACIDRAIN.
Original languageEnglish
Title of host publication7th W’shop on Large-Scale Distributed Systems and Middleware
Subtitle of host publicationLADIS ’13
StatePublished - 2013

Cite this