Okapi：因果一致的地理复制更快，更便宜，更可用
Okapi: Causally Consistent Geo-Replication Made Faster, Cheaper and More Available
摘要：
Okapi是一个新的因果一致的地理复制键值存储。Okapi利用两个关键的设计选择来实现高性能。首先，它依赖于混合逻辑/物理时钟来实现低延迟，即使在存在时钟偏斜的情况下也是如此。其次，Okapi实现了更高的资源效率和更好的可用性，但代价是更新可见性延迟略有增加。为此，Okapi实现了一种新的稳定协议，该协议使用矢量和标量时钟的组合，并在每个数据中心确认其交付时使远程更新可见。我们在Amazon AWS上使用不同的工作负载评估Okapi，使用三个地理分布的区域和96个节点。我们比较了Okapi与最近的两种因果一致性方法Cure和GentleRain。我们表明，Okapi提供了高达两个数量级的性能比GentleRain和Okapi实现了高达3.5倍的低延迟和减少60%的元数据开销相对于治愈。
英文摘要：
Okapi is a new causally consistent geo-replicated key- value store. Okapi leverages two key design choices to achieve high performance. First, it relies on hybrid logical/physical clocks to achieve low latency even in the presence of clock skew. Second, Okapi achieves higher resource efficiency and better availability, at the expense of a slight increase in update visibility latency. To this end, Okapi implements a new stabilization protocol that uses a combination of vector and scalar clocks and makes a remote update visible when its delivery has been acknowledged by every data center. We evaluate Okapi with different workloads on Amazon AWS, using three geographically distributed regions and 96 nodes. We compare Okapi with two recent approaches to causal consistency, Cure and GentleRain. We show that Okapi delivers up to two orders of magnitude better performance than GentleRain and that Okapi achieves up to 3.5x lower latency and a 60% reduction of the meta-data overhead with respect to Cure.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
