ARES: Adaptive, reconfigurable, erasure coded, atomic storage

Nicolas Nicolaou, Viveck Cadambe, N. Prakash, Kishori Konwar, Muriel Medard, Nancy Lynch

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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., [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.

Original languageEnglish (US)
Title of host publicationProceedings - 2019 39th IEEE International Conference on Distributed Computing Systems, ICDCS 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2195-2205
Number of pages11
ISBN (Electronic)9781728125190
DOIs
StatePublished - Jul 2019
Event39th IEEE International Conference on Distributed Computing Systems, ICDCS 2019 - Richardson, United States
Duration: Jul 7 2019Jul 9 2019

Publication series

NameProceedings - International Conference on Distributed Computing Systems
Volume2019-July

Conference

Conference39th IEEE International Conference on Distributed Computing Systems, ICDCS 2019
CountryUnited States
CityRichardson
Period7/7/197/9/19

Fingerprint

Distributed computer systems
Fault tolerance
Scalability
Masks
Availability
Communication
Costs

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Nicolaou, N., Cadambe, V., Prakash, N., Konwar, K., Medard, M., & Lynch, N. (2019). ARES: Adaptive, reconfigurable, erasure coded, atomic storage. In Proceedings - 2019 39th IEEE International Conference on Distributed Computing Systems, ICDCS 2019 (pp. 2195-2205). [8885202] (Proceedings - International Conference on Distributed Computing Systems; Vol. 2019-July). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICDCS.2019.00216
Nicolaou, Nicolas ; Cadambe, Viveck ; Prakash, N. ; Konwar, Kishori ; Medard, Muriel ; Lynch, Nancy. / ARES : Adaptive, reconfigurable, erasure coded, atomic storage. Proceedings - 2019 39th IEEE International Conference on Distributed Computing Systems, ICDCS 2019. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 2195-2205 (Proceedings - International Conference on Distributed Computing Systems).
@inproceedings{85888c6d99554012ac5d24785f22da00,
title = "ARES: Adaptive, reconfigurable, erasure coded, atomic storage",
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., [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.",
author = "Nicolas Nicolaou and Viveck Cadambe and N. Prakash and Kishori Konwar and Muriel Medard and Nancy Lynch",
year = "2019",
month = "7",
doi = "10.1109/ICDCS.2019.00216",
language = "English (US)",
series = "Proceedings - International Conference on Distributed Computing Systems",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "2195--2205",
booktitle = "Proceedings - 2019 39th IEEE International Conference on Distributed Computing Systems, ICDCS 2019",
address = "United States",

}

Nicolaou, N, Cadambe, V, Prakash, N, Konwar, K, Medard, M & Lynch, N 2019, ARES: Adaptive, reconfigurable, erasure coded, atomic storage. in Proceedings - 2019 39th IEEE International Conference on Distributed Computing Systems, ICDCS 2019., 8885202, Proceedings - International Conference on Distributed Computing Systems, vol. 2019-July, Institute of Electrical and Electronics Engineers Inc., pp. 2195-2205, 39th IEEE International Conference on Distributed Computing Systems, ICDCS 2019, Richardson, United States, 7/7/19. https://doi.org/10.1109/ICDCS.2019.00216

ARES : Adaptive, reconfigurable, erasure coded, atomic storage. / Nicolaou, Nicolas; Cadambe, Viveck; Prakash, N.; Konwar, Kishori; Medard, Muriel; Lynch, Nancy.

Proceedings - 2019 39th IEEE International Conference on Distributed Computing Systems, ICDCS 2019. Institute of Electrical and Electronics Engineers Inc., 2019. p. 2195-2205 8885202 (Proceedings - International Conference on Distributed Computing Systems; Vol. 2019-July).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - ARES

T2 - Adaptive, reconfigurable, erasure coded, atomic storage

AU - Nicolaou, Nicolas

AU - Cadambe, Viveck

AU - Prakash, N.

AU - Konwar, Kishori

AU - Medard, Muriel

AU - Lynch, Nancy

PY - 2019/7

Y1 - 2019/7

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85074813353&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85074813353&partnerID=8YFLogxK

U2 - 10.1109/ICDCS.2019.00216

DO - 10.1109/ICDCS.2019.00216

M3 - Conference contribution

AN - SCOPUS:85074813353

T3 - Proceedings - International Conference on Distributed Computing Systems

SP - 2195

EP - 2205

BT - Proceedings - 2019 39th IEEE International Conference on Distributed Computing Systems, ICDCS 2019

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Nicolaou N, Cadambe V, Prakash N, Konwar K, Medard M, Lynch N. ARES: Adaptive, reconfigurable, erasure coded, atomic storage. In Proceedings - 2019 39th IEEE International Conference on Distributed Computing Systems, ICDCS 2019. Institute of Electrical and Electronics Engineers Inc. 2019. p. 2195-2205. 8885202. (Proceedings - International Conference on Distributed Computing Systems). https://doi.org/10.1109/ICDCS.2019.00216