Abstract

The erasure codes such as Reed-Solomon (RS) code and Cauchy Reed-Solomon (CRS) code have been widely used in distributed storage system. Though all the erasure codes are able to help recover the storage data successfully when errors happening, the computation cost of different Cauchy CODEC implementation makes a great impact to the performance of its practical application especially due to its complexity of generating the decoding matrix. This paper introduces a new high-speed Cauchy algorithm to construct an encoding algorithm based on the hardware implementation mechanism of decoding. In comparison to Gauss LU, GS-Cauchy, GS-direct-Cauchy for both decoding matrix generation and CODEC all through, the proposed algorithm requires much less complexities to gain the same performance of CRS.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.