Availability and locality in distributed storage
Ankit Singh Rawat, Dimitris Papailiopoulos, Alexandros G. Dimakis
Abstract
Ankit Singh Rawat, Dimitris Papailiopoulos, Alexandros G. Dimakis
Abstract
Modern distributed file systems are deploying erasure codes to increase storage efficiency compared to block replication. Initially, classical error-correcting codes (like Reed-Solomon) were used but the benefits of custom code designs are now clear. Multiple companies including Microsoft and Facebook are designing and deploying distributed storage codes. Still, however, the fundamental information theoretic limits are not fully understood. Further, there has been significant activity on explicit code designs that are repair efficient and provide high data-availability. We present an overview of open problems and directions for modern distributed storage coding that offers higher data availability.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Modern distributed file systems are deploying erasure codes to increase storage efficiency compared to block replication. Initially, classical error-correcting codes (like Reed-Solomon) were used but the benefits of custom code designs are now clear. Multiple companies including Microsoft and Facebook are designing and deploying distributed storage codes. Still, however, the fundamental information theoretic limits are not fully understood. Further, there has been significant activity on explicit code designs that are repair efficient and provide high data-availability. We present an overview of open problems and directions for modern distributed storage coding that offers higher data availability.
Key concepts: Distributed data store, Erasure code, Computer science, Locality, Replication (statistics), Distributed computing, Distributed database, Storage efficiency