Erasure coding for distributed storage: An overview
In a distributed storage system, code symbols are dispersed across space in nodes or
storage units as opposed to time. In settings such as that of a large data center, an important …
storage units as opposed to time. In settings such as that of a large data center, an important …
Exploiting combined locality for {Wide-Stripe} erasure coding in distributed storage
Erasure coding is a low-cost redundancy mechanism for distributed storage systems by
storing stripes of data and parity chunks. Wide stripes are recently proposed to suppress the …
storing stripes of data and parity chunks. Wide stripes are recently proposed to suppress the …
[图书][B] Concise encyclopedia of coding theory
Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …
Repair pipelining for erasure-coded storage: Algorithms and evaluation
We propose repair pipelining, a technique that speeds up the repair performance in general
erasure-coded storage. By carefully scheduling the repair of failed data in small-size units …
erasure-coded storage. By carefully scheduling the repair of failed data in small-size units …
{Near-Optimal} Latency Versus Cost Tradeoffs in {Geo-Distributed} Storage
By replicating data across sites in multiple geographic regions, web services can maximize
availability and minimize latency for their users. However, when sacrificing data consistency …
availability and minimize latency for their users. However, when sacrificing data consistency …
{ParaRC}: Embracing {Sub-Packetization} for Repair Parallelization in {MSR-Coded} Storage
Minimum-storage regenerating (MSR) codes are provably optimal erasure codes that
minimize the repair bandwidth (ie, the amount of traffic being transferred during a repair …
minimize the repair bandwidth (ie, the amount of traffic being transferred during a repair …
Explicit constructions of MSR codes for clustered distributed storage: The rack-aware storage model
Z Chen, A Barg - IEEE Transactions on Information Theory, 2019 - ieeexplore.ieee.org
The paper is devoted to the problem of erasure coding in distributed storage. We consider a
model of storage that assumes that nodes are organized into equally sized groups, called …
model of storage that assumes that nodes are organized into equally sized groups, called …
{PACEMAKER}: Avoiding {HeART} attacks in storage clusters with disk-adaptive redundancy
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 …
cost overhead. Substantial space-savings can be realized by tuning redundancy schemes to …
Bandwidth-aware scheduling repair techniques in erasure-coded clusters: Design and analysis
Erasure codes offer a storage-efficient redundancy mechanism for maintaining data
availability guarantees in storage clusters, yet also incur high network traffic consumption …
availability guarantees in storage clusters, yet also incur high network traffic consumption …
{OpenEC}: Toward Unified and Configurable Erasure Coding Management in Distributed Storage Systems
Erasure coding becomes a practical redundancy technique for distributed storage systems
to achieve fault tolerance with low storage overhead. Given its popularity, research studies …
to achieve fault tolerance with low storage overhead. Given its popularity, research studies …