Back to search

University of Waterloo

Eventually Durable State Machines

Abstract

dc:description.abstract

Typically, applications are designed to guarantee durability of the data they store. Durability is achieved by replicating client write requests to multiple machines. This replication adds to the time it takes for the application to respond to client requests. And so, latency-sensitive applications may implement ad-hoc mechanisms to circumvent durability costs, such as responding without replicating writes. Such ad-hoc mechanisms are hard to reason about and may leave the application in an inconsistent state. We propose Eventually Durable State Machine, a principled approach for applications to respond without waiting for replication to complete. The ED model offers fast response time but leaves applications vulnerable to data loss when failures occur. The ED model presents a strong ordering guarantee and a clear failure semantics to reason about the lost writes. Further, we develop ED Raft protocol, a derivative of the Raft consensus protocol, to implement the Eventually Durable State Machine. We describe the ED Raft and its key properties, and show that ED Raft supports the ED model.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2024

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Kathuria, Kriti
Advisor dc:contributor.advisor
  • Salem, Ken

Subjects

dc:subject × 2

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/20705

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Kathuria, Kriti. Eventually Durable State Machines. University of Waterloo, 2024. http://hdl.handle.net/10012/20705