Notice

This is not the latest version of this item. The latest version can be found at:https://dspace.mit.edu/handle/1721.1/137575.3

Show simple item record

dc.contributor.authorNicolaou, Nicolas
dc.contributor.authorCadambe, Viveck
dc.contributor.authorPrakash, N.
dc.contributor.authorKonwar, Kishori
dc.contributor.authorMedard, Muriel
dc.contributor.authorLynch, Nancy
dc.date.accessioned2022-05-31T20:27:57Z
dc.date.available2021-11-05T18:44:14Z
dc.date.available2022-05-31T20:27:57Z
dc.date.issued2019-10
dc.date.submitted2019-07
dc.identifier.issn2575-8411
dc.identifier.issn978-1-7281-2519-0
dc.identifier.urihttps://hdl.handle.net/1721.1/137575.2
dc.description.abstract© 2019 IEEE. 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.en_US
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/icdcs.2019.00216en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceMIT web domainen_US
dc.titleARES: Adaptive, Reconfigurable, Erasure Coded, Atomic Storageen_US
dc.typeArticleen_US
dc.identifier.citationNicolaou, Nicolas, Cadambe, Viveck, Prakash, N, Konwar, Kishori, Medard, Muriel et al. 2019. "ARES: Adaptive, Reconfigurable, Erasure Coded, Atomic Storage." Proceedings - International Conference on Distributed Computing Systems, 2019-July.en_US
dc.relation.journalProceedings - International Conference on Distributed Computing Systemsen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2021-01-29T13:46:40Z
dspace.orderedauthorsNicolaou, N; Cadambe, V; Prakash, N; Konwar, K; Medard, M; Lynch, Nen_US
dspace.date.submission2021-01-29T13:46:44Z
mit.journal.volume2019-Julyen_US
mit.licenseOPEN_ACCESS_POLICY
mit.metadata.statusAuthority Work Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

VersionItemDateSummary

*Selected version