Corpus ID: 13015945

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

@inproceedings{Plank2005OptimizingCR,
  title={Optimizing Cauchy Reed-Solomon Codes for Fault-Tolerant Storage Applications},
  author={J. 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… Expand
Optimizing Cauchy Reed-Solomon Codes for Fault-Tolerant Network Storage Applications
  • J. Plank, Lihao Xu
  • Computer Science
  • Fifth IEEE International Symposium on Network Computing and Applications (NCA'06)
  • 2006
TLDR
This paper presents an improvement to Cauchy Reed-Solomon coding that is based on optimizing theCauchy distribution matrix, and details an algorithm for generating good matrices and evaluates the performance of encoding using all implementations Reed- Solomon codes, plus the best MDS codes from the literature. Expand
A Practical Study of Exact-BASIC Codes at the MSR Point in Distributed Storage Systems
—Regenerating codes have been proven a class of optimal distributed storage codes in the tradeoff between storage capacity and repair bandwidth. However, existing regenerating codes rely on expensiveExpand
Fast Failure Erasure Encoding Using Just in Time Compilation for CPUs, GPUs, and FPGAs
TLDR
The optimized JIT code leverages the full potential of modern processors reaching an instruction throughput of more than three SIMD-instructions per compute cycle, and encodes up to 19 gigabytes of data per second on a Skylake system. Expand
Construction of exact-BASIC codes for distributed storage systems at the MSR point
TLDR
The results of simulation show minimum-storage BASIC codes outperform Cauchy Reed-Solomon codes in both repairing cost and coding cost. Expand
UMR-EC: A Unified and Multi-Rail Erasure Coding Library for High-Performance Distributed Storage Systems
TLDR
This paper proposes UMR-EC, a Unified and Multi-Rail Erasure Coding library that can fully exploit heterogeneous EC coders, complemented by asynchronous semantics with optimized metadata-free scheme and EC rate-aware task scheduling that can enable a highly-efficient I/O pipeline. Expand
GRID codes: Strip-based erasure codes with high fault tolerance for storage systems
TLDR
This article presents a new family of erasure codes with high fault tolerance, named GRID codes, a family of strip-based codes whose strips are arranged into multi-dimensional grids whose storage efficiency can reach up to 80% and even higher and introduces a concept of matched codes and discusses how to use matched codes to construct GRIDs. Expand
Convertible Codes: New Class of Codes for Efficient Conversion of Coded Data in Distributed Storage
TLDR
This work presents a new framework to formalize the notion of code conversion, and presents convertible codes, a new class of code pairs that allow for code conversions in a resource-efficient manner and proves tight bounds on the number of nodes accessed during code conversion. Expand
Online Encoding for Erasure-Coded Distributed Storage Systems
TLDR
An online encoding method is proposed, which encodes data as soon as it is inserted into the system, which can reduce data transfer, reduce data write, and eliminate all data read compared to traditional offline encoding. Expand
An Efficient Coding Scheme for Tolerating Double Disk Failures
TLDR
A new MDS array erasure code, called DA-Code, which can tolerate double disk erasures for highly reliable data storage system is proposed in this paper and result shows that the new coding scheme has excellent performance. Expand
Constructing double- and triple-erasure-correcting codes with high availability using mirroring and parity approaches
TLDR
Simulation results show that, compared with other double- and triple-erasure codes, MPDC and MPPDC have comparative light-load and moderate- load performance and better heavy-load performance in fault-free mode and because parity declustering is used, the two codes are far superior in degraded- and reconstruction-mode performance. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 54 REFERENCES
EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures
TLDR
A novel method for tolerating up to two disk failures in RAID architectures based on Reed-Solomon error-correcting codes, which can be used in any system requiring large symbols and relatively short codes, for instance, in multitrack magnetic recording. Expand
Assessing the performance of erasure codes in the wide-area
TLDR
It is concluded that although LDPC codes have an advantage over Reed-Solomon codes in terms of decoding cost, this advantage does not always translate to the best overall performance in wide-area storage situations. Expand
A Tutorial on Reed-Solomon Coding for Fault-Tolerance in RAID-Like Systems
  • J. Plank
  • Computer Science
  • Softw. Pract. Exp.
  • 1997
TLDR
The goal of this paper is for a systems programmer to be able to implement Reed-Solomon coding for reliability in RAID-like systems without needing to consult any external references, and this specification assumes no prior knowledge of algebra or coding theory. Expand
A practical analysis of low-density parity-check erasure codes for wide-area storage applications
  • J. Plank, M. Thomason
  • Computer Science
  • International Conference on Dependable Systems and Networks, 2004
  • 2004
TLDR
This analysis focuses on the performance of individual codes for finite systems, and addresses several important heretofore unanswered questions about employing LDPC codes in real-world systems. Expand
WEAVER codes: highly fault tolerant erasure codes for storage systems
TLDR
The WEAVER codes are new families of simple highly fault tolerant XOR-based erasure codes for storage systems (with fault tolerance up to 12) and have optimal storage efficiency among all codes with constrained parity in-degree. Expand
RobuSTore: Robust Performance for Distributed Storage Systems
TLDR
The design and an evaluation of RobuSTore are presented, which shows improved robustness, reducing the standard deviation of access latencies by as much as 5-fold vs. traditional RAID and improving access bandwidth by asmuch as 15-fold. Expand
Note: Correction to the 1997 tutorial on Reed–Solomon coding
TLDR
The purpose of this note is to present a correct infor mation dispersal matrix that has the desired properties, and to put the work in current context. Expand
Reed-Solomon Codes and Their Applications
TLDR
R Reed-Solomon Codes and the Design of Sequences for Spread-Spectrum Multiple-Access Communications, edited by D. McEliece and L. Pursley. Expand
Practical loss-resilient codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encod-ing and decoding algorithms forExpand
HoVer Erasure Codes For Disk Arrays
  • J. L. Hafner
  • Computer Science
  • International Conference on Dependable Systems and Networks (DSN'06)
  • 2006
TLDR
A new family of XOR-based erasure codes primarily targeted for use in disk arrays that have a unique data/parity layout, with both horizontal and vertical parity arrangements giving rise to the name HoVer codes. Expand
...
1
2
3
4
5
...