To refer to this page use:
|Abstract:||Linearizability reduces the complexity of building correct applications. However, there is a tradeoff between using linearizability for geo-replicated storage and low tail latency. Traditional approaches use consensus to implement linearizable replicated state machines, but consensus is inefficient for workloads composed mostly of reads and writes. We present the design, implementation, and evaluation of Gryff, a system that offers linearizability and low tail latency by unifying consensus with shared registers. Gryff introduces carstamps to correctly order reads and writes without incurring unnecessary constraints that are required when ordering stronger synchronization primitives. Our evaluation shows that Gryff’s combination of an optimized shared register protocol with EPaxos allows it to provide lower service-level latency than EPaxos or MultiPaxos due to its lower tail latency for reads.|
|Citation:||Burke, Matthew, Audrey Cheng, and Wyatt Lloyd. "Gryff: Unifying consensus and shared registers." In 17th USENIX Symposium on Networked Systems Design and Implementation (2020): pp. 591-617.|
|Pages:||591 - 617|
|Type of Material:||Conference Article|
|Journal/Proceeding Title:||17th USENIX Symposium on Networked Systems Design and Implementation|
|Version:||Final published version. This is an open access article.|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.