Large-scale cluster storage systems use redundancy (via erasure coding) to ensure data
durability. Disk-adaptive redundancy—dynamically tailoring the redundancy scheme to …

Data redundancy provides resilience in large-scale storage clusters, but imposes significant
cost overhead. Substantial space-savings can be realized by tuning redundancy schemes to …

Erasure codes are essential for providing efficient resilience against node failures in
distributed storage. Typically, an erasure code encodes symbols into symbols which are …

In large-scale distributed storage systems, erasure codes are used to achieve fault tolerance
in the face of node failures. Tuning code redundancy to observed failure rates has been …

Erasure codes are typically used in large-scale distributed storage systems to provide
durability of data in the face of failures. In this setting, a set of k blocks to be stored is …

To adapt to the increasing storage demands and varying storage redundancy requirements,
practical distributed storage systems need to support storage scaling by relocating currently …

Erasure codes have become an integral part of distributed storage systems as a tool for
providing data reliability and durability under the constant threat of device failures. In such …

It is critical to support efficient scaling in distributed storage systems so as to meet increasing
storage demands with new storage nodes. However, the scaling process incurs substantial …

Distributed storage systems must store large amounts of data over long periods of time. To
avoid data loss due to device failures, an [n, k] erasure code is used to encode k data …

We propose a delayed parity generation technique for maximum distance separable (MDS)
storage codes, for two possible applications: the first is to improve the write-speed during …