Warranties for faster strong consistency

  • Authors:
  • Jed Liu;Tom Magrino;Owen Arden;Michael D. George;Andrew C. Myers

  • Affiliations:
  • Cornell University, Department of Computer Science;Cornell University, Department of Computer Science;Cornell University, Department of Computer Science;Cornell University, Department of Computer Science;Cornell University, Department of Computer Science

  • Venue:
  • NSDI'14 Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new mechanism, warranties, to enable building distributed systems with linearizable transactions. A warranty is a time-limited assertion about one or more distributed objects. These assertions generalize optimistic concurrency control, improving throughput because clients holding warranties need not communicate to verify the warranty's assertion. Updates that might cause an active warranty to become false are delayed until the warranty expires, trading write latency for read latency. For workloads biased toward reads, warranties improve scalability and system throughput. Warranties can be expressed using language-level computations, and they integrate harmoniously into the programming model as a form of memoization. Experiments with some non-trivial programs demonstrate that warranties enable high performance despite the simple programming model.