Name
Abstract | ||
|---|---|---|
We address the problem of minimizing the I/O needed to recover from disk failures in erasure-coded storage systems. The principal result is an algorithm that finds the optimal I/O recovery from an arbitrary number of disk failures for any XOR-based erasure code. We also describe a family of codes with high-fault tolerance and low recovery I/O, e.g. one instance tolerates up to 11 failures and recovers a lost block in 4 I/Os. While we have determined I/O optimal recovery for any given code, it remains an open problem to identify codes with the best recovery properties. We describe our ongoing efforts toward characterizing space overhead versus recovery I/O tradeoffs and generating codes that realize these bounds. |
Year | Venue | Keywords |
|---|---|---|
2011 | HotStorage | o-optimal recovery,erasure-coded storage system,best recovery property,o optimal recovery,open problem,arbitrary number,o tradeoffs,low recovery,o recovery,xor-based erasure code,disk failure |
Field | DocType | Citations |
Open problem,Computer science,Parallel computing,Input/output,Erasure code,Distributed computing | Conference | 27 |
PageRank | References | Authors |
2.08 | 16 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Osama Khan | 1 | 494 | 19.97 |
| Randal Burns | 2 | 1955 | 115.15 |
| James Park | 3 | 27 | 2.08 |
| Cheng Huang | 4 | 720 | 43.59 |