ARES: Adaptive, Reconfigurable, Erasure coded, Atomic Storage
Author(s)
Nicolaou, Nicolas
Cadambe, Viveck
Prakash, N.
Trigeorgi, Andria
Konwar, Kishori
Medard, Muriel
Lynch, Nancy
Date Issued
November 12, 2022
Journal
ACM Transactions on Storage
Publisher
Association for Computing Machinery
Citation
Nicolas Nicolaou, Viveck Cadambe, N. Prakash, Andria Trigeorgi, Kishori Konwar, Muriel Medard, and Nancy Lynch. 2022. Ares: Adaptive, Reconfigurable, Erasure coded, Atomic Storage. ACM Trans. Storage 18, 4, Article 33 (November 2022), 39 pages.
Version
Final published version
Abstract
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., [11]) 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 fixed 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 (DAPs). 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.
MIT Department
Massachusetts Institute of Technology. Research Laboratory of Electronics
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3510613
