Optimizing Cauchy Reed-Solomon Codes for Fault-Tolerant Storage Applications

@inproceedings{Plank2005OptimizingCR,
  title={Optimizing Cauchy Reed-Solomon Codes for Fault-Tolerant Storage Applications},
  author={James S. Plank},
  year={2005}
}
In the past few years, all manner of storage systems, ranging from disk array systems to distributed and widearea systems, have started to grapple with the reality of tolerating multiple simultaneous failures of storage nodes. Unlike the single failure case, which is optimally handled with RAID Level-5 parity, the multiple failure case is more difficult because optimal general purpose strategies are not yet known. Erasure Codingis the field of research that deals with these strategies, and this… CONTINUE READING
Highly Cited
This paper has 72 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 50 extracted citations

73 Citations

01020'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 73 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 32 references

The IBM intelligent brick project – petabytes and beyond

  • W. Wilcke
  • IBM Journal of Research and Development April
  • 2006

A practical analysis oflowdensity paritycheck erasure codes for wide - area storage applictions

  • M. G. Thomason.
  • Enumeration of optimal and good Cauchy matrices…
  • 2005

Technical Report CS-05-570

  • J. S. Plank. Enumeration of optimal, good Cauchy m Reed-Solomon coding
  • Univers of Tennessee, December
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…