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

作者: James S Plank , Lihao Xu

DOI: 10.1109/NCA.2006.43

关键词: RAIDErasure codeComputer scienceCauchy distributionDisk arrayReed–Solomon error correctionParallel computingDecoding methods

摘要: In the past few years, all manner of storage applications, ranging from disk array systems to distributed and wide-area 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 Coding is the field of research that deals with these strategies, and this field has blossomed in recent years …

参考文章(41)
Malik Kalfane, Johannes Blömer, Richard Karp, Michael Luby, Marek Karpinski, David Zuckerman, An XOR-based erasure-resilient coding scheme Technical report at ICSI. ,(1995)
Saejoon Kim, Stephen B. Wicker, Fundamentals of Codes, Graphs, and Iterative Decoding ,(2002)
Stephen B. Wicker, Vijay K. Bhargava, Reed-Solomon Codes and Their Applications Reed-Solomon Codes and Their Applications. pp. 336- 336 ,(1999) , 10.1109/9780470546345
Florence Jessie MacWilliams, Neil James Alexander Sloane, The Theory of Error-Correcting Codes ,(1977)
Tomislav Grcanac, Bob English, Atul Goel, Sunitha Sankar, Peter Corbett, James Leong, Steven Kleiman, Row-diagonal parity for double disk failure correction file and storage technologies. pp. 1- 1 ,(2004)
James S. Plank, Ying Ding, Note: Correction to the 1997 tutorial on Reed–Solomon coding Software - Practice and Experience. ,vol. 35, pp. 189- 194 ,(2005) , 10.1002/SPE.V35:2