Codes for Distributed Storage

10/03/2020
by   Vinayak Ramkumar, et al.
0

This chapter deals with the topic of designing reliable and efficient codes for the storage and retrieval of large quantities of data over storage devices that are prone to failure. For long, the traditional objective has been one of ensuring reliability against data loss while minimizing storage overhead. More recently, a third concern has surfaced, namely of the need to efficiently recover from the failure of a single storage unit, corresponding to recovery from the erasure of a single code symbol. We explain here, how coding theory has evolved to tackle this fresh challenge.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

06/12/2018

Erasure Coding for Distributed Storage: An Overview

In a distributed storage system, code symbols are dispersed across space...
03/04/2018

Applied Erasure Coding in Networks and Distributed Storage

The amount of digital data is rapidly growing. There is an increasing us...
04/08/2020

Deterministic Data Distribution for Efficient Recovery in Erasure-Coded Storage Systems

Due to individual unreliable commodity components, failures are common i...
11/05/2020

On cyclic LRC codes that are also LCD codes

Locally recoverable (LRC) codes provide a solution to single node failur...
07/27/2021

On the data persistency of replicated erasure codes in distributed storage systems

This paper studies the fundamental problem of data persistency for a gen...
10/06/2018

Alpha Entanglement Codes: Practical Erasure Codes to Archive Data in Unreliable Environments

Data centres that use consumer-grade disks drives and distributed peer-t...
08/25/2019

Babel Storage: Uncoordinated Content Delivery from Multiple Coded Storage Systems

In future content-centric networks, content is identified independently ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.