Name
Title | ||
|---|---|---|
Rethinking erasure codes for cloud file systems: minimizing I/O for recovery and degraded reads |
Abstract | ||
|---|---|---|
To reduce storage overhead, cloud file systems are transitioning from replication to erasure codes. This process has revealed new dimensions on which to evaluate the performance of different coding schemes: the amount of data used in recovery and when performing degraded reads. We present an algorithm that finds the optimal number of codeword symbols needed for recovery for any XOR-based erasure code and produces recovery schedules that use a minimum amount of data. We differentiate popular erasure codes based on this criterion and demonstrate that the differences improve I/O performance in practice for the large block sizes used in cloud file systems. Several cloud systems [15, 10] have adopted Reed-Solomon (RS) codes, because of their generality and their ability to tolerate larger numbers of failures. We define a new class of rotated Reed-Solomon codes that perform degraded reads more efficiently than all known codes, but otherwise inherit the reliability and performance properties of Reed-Solomon codes. |
Year | Venue | Keywords |
|---|---|---|
2012 | FAST | o performance,cloud system,minimum amount,recovery schedule,new class,reed-solomon code,performance property,xor-based erasure code,cloud file system,popular erasure code |
Field | DocType | Citations |
Online codes,Fountain code,Computer science,Parallel computing,Input/output,Real-time computing,Coding (social sciences),Code word,Tornado code,Erasure code,Cloud computing | Conference | 150 |
PageRank | References | Authors |
4.67 | 33 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Osama Khan | 1 | 494 | 19.97 |
| Randal Burns | 2 | 1955 | 115.15 |
| James Plank | 3 | 156 | 5.17 |
| William Pierce | 4 | 150 | 4.67 |
| Cheng Huang | 5 | 720 | 43.59 |