Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication
 
conference paper

PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication

Spirovska, Kristina  
•
Didona, Diego  
•
Zwaenepoel, Willy  
January 1, 2019
2019 39Th Ieee International Conference On Distributed Computing Systems (Icdcs 2019)
39th IEEE International Conference on Distributed Computing Systems (ICDCS)

Geo-replicated data platforms are the backbone of several large-scale online services. Transactional Causal Consistency (TCC) is an attractive consistency level for building such platforms. TCC avoids many anomalies of eventual consistency, eschews the synchronization costs of strong consistency, and supports interactive read-write transactions. Partial replication is another attractive design choice for building geo-replicated platforms, as it reduces storage requirements and update propagation costs.

This paper presents PaRiS, the first TCC system that supports partial replication and implements non-blocking parallel read operations. The latter reduce read latency which is of paramount importance for the performance of read-intensive applications. PaRiS relies on a novel protocol to track dependencies, called Universal Stable Time (UST). By means of a lightweight background gossip process, UST identifies a snapshot of the data that has been installed by every data center (DC) in the system. Hence, transactions can consistently read from such a snapshot on any server in any replication site without having to block. Moreover, PaRiS requires only one timestamp to track dependencies and define transactional snapshots, thereby achieving resource efficiency and scalability.

We evaluate PaRiS on an AWS deployment composed of up to 10 replication sites. We demonstrate a performance gain of non-blocking reads vs. a blocking alternative (up to 1.47x higher throughput with 5.91x lower latency for read-dominated workloads and up to 1.46x higher throughput with 20.56x lower latency for write-heavy workloads). We also show that the throughput penalty incurred to implement causal consistency, compared to variant without the causal consistency guarantees, is as low as 20% for read-heavy workloads and 37% for write-heavy workloads. We furthermore show that PaRiS scales well with the number of DCs and partitions, while being able to handle larger data-sets than existing solutions that assume full replication.

  • Details
  • Metrics
Type
conference paper
DOI
10.1109/ICDCS.2019.00038
Web of Science ID

WOS:000565234200029

Author(s)
Spirovska, Kristina  
Didona, Diego  
Zwaenepoel, Willy  
Date Issued

2019-01-01

Publisher

IEEE COMPUTER SOC

Publisher place

Los Alamitos

Published in
2019 39Th Ieee International Conference On Distributed Computing Systems (Icdcs 2019)
ISBN of the book

978-1-7281-2519-0

Series title/Series vol.

IEEE International Conference on Distributed Computing Systems

Start page

304

End page

316

Subjects

Computer Science, Hardware & Architecture

•

Computer Science, Information Systems

•

Computer Science, Software Engineering

•

Computer Science, Theory & Methods

•

Computer Science

•

time

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LABOS  
Event nameEvent placeEvent date
39th IEEE International Conference on Distributed Computing Systems (ICDCS)

Richardson, TX

Jul 07-09, 2019

Available on Infoscience
September 17, 2020
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/171714
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés