Gryff: Unifying Consensus and Shared Registers
Gryff: Unifying Consensus and Shared Registers
复制标题
DOI:
--
复制
发表时间:
2020
期刊:
影响因子:
--
通讯作者:
Matthew Burke;Audrey Cheng;Wyatt Lloyd
中科院分区:
文献类型:
--
作者:
Matthew Burke;Audrey Cheng;Wyatt Lloyd
Linearizability reduces the complexity of building correct applications. However, there is a tradeoff between using lin-earizability for geo-replicated storage and low tail latency. Traditional approaches use consensus to implement lineariz-able 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 much lower tail latency for reads.