ARES: Adaptive, Reconfigurable, Erasure Coded, Atomic Storage

ARES: Adaptive, Reconfigurable, Erasure Coded, Atomic Storage
复制标题

DOI：
10.1109/icdcs.2019.00216
复制
发表时间：
2018-05
期刊：
2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS)
影响因子：
--
通讯作者：
N. Nicolaou;V. Cadambe;N. Prakash;I. Corp;Andria Trigeorgi;K. Konwar;M. Médard;N. Lynch
N. Nicolaou;V. Cadambe;N. Prakash;I. Corp;Andria Trigeorgi;K. Konwar;M. Médard;N. Lynch
中科院分区：
其他
文献类型：
--
作者：
N. Nicolaou;V. Cadambe;N. Prakash;I. Corp;Andria Trigeorgi;K. Konwar;M. Médard;N. Lynch

文献摘要

相似文献

模拟共享原子、读/写存储系统是分布式计算中的一个基本问题。在一组数据主机之间复制原子对象是传统实现的规范(例如，[6])，以便在主机故障的情况下保证数据的可用性和可访问性。由于复制对存储要求很高，最近的方法建议使用擦除码来提供相同的容错能力，同时优化主机的存储使用。最初的工作重点是一组固定的数据主机。为了保证寿命和可扩展性，存储服务应该能够动态掩蔽主机故障，方法是允许新主机加入，并在不中断服务的情况下删除故障主机。这项工作提出了第一个基于擦除码的原子算法，称为ARES，它允许主机集在执行过程中被修改。ARES由三个主要组件组成：(I)重新配置协议，(Ii)读/写协议，和(Iii)一组数据访问原语。ARES的设计是模块化的，以便在每个配置的基础上适应各种擦除码参数的使用。我们给出了读/写操作延迟的界限，并分析了ARES算法的存储和通信开销。
Emulating a shared atomic, read/write storage system is a fundamental problem in distributed computing. Replicating atomic objects among a set of data hosts was the norm for traditional implementations (e.g., [6]) in order to guarantee the availability and accessibility of the data despite host failures. As replication is highly storage demanding, recent approaches suggested the use of erasure-codes to offer the same fault-tolerance while optimizing storage usage at the hosts. Initial works focused on a fix set of data hosts. To guarantee longevity and scalability, a storage service should be able to dynamically mask hosts failures by allowing new hosts to join, and failed host to be removed without service interruptions. This work presents the first erasure-code based atomic algorithm, called ARES, which allows the set of hosts to be modified in the course of an execution. ARES is composed of three main components: (i) a reconfiguration protocol, (ii) a read/write protocol, and (iii) a set of data access primitives. The design of ARES is modular and is such to accommodate the usage of various erasure-code parameters on a per-configuration basis. We provide bounds on the latency of read/write operations and analyze the storage and communication costs of the ARES algorithm.