Chain replication in theory and in practice

Chain replication in theory and in practice
复制标题

链式复制的理论与实践

DOI:
--
复制
发表时间:
2010
期刊:
Erlang Workshop
影响因子:
--
通讯作者:
S. Fritchie
S. Fritchie
中科院分区:
--
文献类型:
--
作者:
S. Fritchie

文献摘要

被引文献

相似文献

在实现分布式存储系统时,使用具有形式化定义和证明的算法是一个明智的想法。然而,将任何算法转换成有效的代码可能是困难的,因为实现必须正确和快速。 本文是一个案例研究的链复制协议在分布式键值存储称为Hibari的实现。从理论上讲,链复制算法非常简单,并且应该可以直接正确实现。然而,在实践中,有许多实施细节具有深远而微妙的影响。Erlang社区以及一般的分布式系统实现者可以使用Hibari的经验教训(特别是在性能增强和故障检测方面)来避免理论和现实世界计算之间的许多危险。
When implementing a distributed storage system, using an algorithm with a formal definition and proof is a wise idea. However, translating any algorithm into effective code can be difficult because the implementation must be both correct and fast. This paper is a case study of the implementation of the chain replication protocol in a distributed key-value store called Hibari. In theory, the chain replication algorithm is quite simple and should be straightforward to implement correctly. In practice, however, there were many implementation details that had effects both profound and subtle. The Erlang community, as well as distributed systems implementors in general, can use the lessons learned with Hibari (specifically in areas of performance enhancements and failure detection) to avoid many dangers that lurk at the interface between theory and real-world computing.