Invalidation-Based Protocols for Replicated Datastores
Antonios Katsarakis

TL;DR
This paper proposes adapting invalidation-based protocols from multiprocessors to improve the performance of strongly consistent replicated datastores in datacenter environments, emphasizing fault tolerance and distributed transaction support.
Contribution
It introduces a novel adaptation of invalidation protocols for datastores, addressing challenges like skewed data access, fault tolerance, and distributed transactions.
Findings
Enhanced protocol performance in fault-free scenarios
Improved fault tolerance with invalidation-based methods
Effective handling of distributed transactions
Abstract
Distributed in-memory datastores underpin cloud applications that run within a datacenter and demand high performance, strong consistency, and availability. A key feature of datastores is data replication. The data are replicated across servers because a single server often cannot handle the request load. Replication is also necessary to guarantee that a server or link failure does not render a portion of the dataset inaccessible. A replication protocol is responsible for ensuring strong consistency between the replicas of a datastore, even when faults occur, by determining the actions necessary to access and manipulate the data. Consequently, a replication protocol also drives the datastore's performance. Existing strongly consistent replication protocols deliver fault tolerance but fall short in terms of performance. Meanwhile, the opposite occurs in the world of multiprocessors,…
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 · Advanced Data Storage Technologies
