GMU: Genuine Multiversion Update-Serializable Partial Data Replication

doi:10.1109/TPDS.2015.2510998

GMU: Genuine Multiversion Update-Serializable Partial Data Replication

2016-10-01

5

PRE

AI

DOI：10.1109/TPDS.2015.2510998

Original

Original request for help

Save

Abstract

En 中文

In this article we introduce GMU, a genuine partial replication protocol for transactional systems, which exploits an innovative, highly scalable, distributed multiversioning scheme. Unlike existing multiversion-based solutions, GMU does not rely on any global logical clock, which may represent a contention point and a major impairment to system scalability. Also, GMU never aborts read-only transactions and spares them from undergoing distributed validation schemes. This makes GMU particularly efficient in presence of read-intensive workloads, as typical of a wide range of real-world applications. GMU guarantees the Extended Update Serializability (EUS) isolation level. This consistency criterion is particularly attractive as it is sufficiently strong to ensure correctness even for very demanding applications (such as TPC-C), but is also weak enough to allow efficient and scalable implementations, such as GMU. Further, unlike several relaxed consistency models proposed in literature, EUS shows simple and intuitive semantics, thus being an attractive consistency model for ordinary programmers. We integrated GMU in a popular open source in-memory transactional data grid, namely Infinispan. On the basis of a wide experimental study performed on heterogeneous platforms and using industry standard benchmarks (namely TPC-C and YCSB), we show that GMU achieves almost linear scalability and that it introduces reduced overhead, with respect to solutions ensuring non-serializable semantics, in a wide range of workloads.

Keywords:

Partial data replication

multiversioning

transactional systems

fault tolerance

GMU: Genuine Multiversion Update-Serializable Partial Data Replication

Abstract

AI Summary

Journal

Organization