Paper Info
Title
Having your cake and eating it too: jointly optimal erasure codes for I/O, storage and network-bandwidth
Abstract
Erasure codes, such as Reed-Solomon (RS) codes, are increasingly being deployed as an alternative to data-replication for fault tolerance in distributed storage systems. While RS codes provide significant savings in storage space, they can impose a huge burden on the I/O and network resources when reconstructing failed or otherwise unavailable data. A recent class of erasure codes, called minimum-storage-regeneration (MSR) codes, has emerged as a superior alternative to the popular RS codes, in that it minimizes network transfers during reconstruction while also being optimal with respect to storage and reliability. However, existing practical MSR codes do not address the increasingly important problem of I/O overhead incurred during reconstructions, and are, in general, inferior to RS codes in this regard. In this paper, we design erasure codes that are simultaneously optimal in terms of I/O, storage, and network bandwidth. Our design builds on top of a class of powerful practical codes, called the product-matrix-MSR codes. Evaluations show that our proposed design results in a significant reduction the number of I/Os consumed during reconstructions (a 5× reduction for typical parameters), while retaining optimality with respect to storage, reliability, and network bandwidth.
Year
Venue
Field
2015
FAST
Online codes,Computer science,Fountain code,Turbo code,Distributed data store,Parallel computing,Computer network,Theoretical computer science,Input/output,Bandwidth (signal processing),Tornado code,Erasure code
DocType
Citations 
PageRank 
Conference
36
1.05
References 
Authors
27
5
Name
Order
Citations
PageRank
Rashmi K. V.1100765.03
Preetum Nakkiran2646.05
Jingyan Wang3371.74
Nihar B. Shah4120277.17
Kannan Ramchandran594011029.57