An efficient XOR-scheduling algorithm for erasure codes encoding | IEEE Conference Publication | IEEE Xplore

An efficient XOR-scheduling algorithm for erasure codes encoding


Abstract:

In large storage systems, it is crucial to protect data from loss due to failures. Erasure codes lay the foundation of this protection, enabling systems to reconstruct lo...Show More

Abstract:

In large storage systems, it is crucial to protect data from loss due to failures. Erasure codes lay the foundation of this protection, enabling systems to reconstruct lost data when components fail. Erasure codes can however impose significant performance overhead in two core operations: encoding, where coding information is calculated from newly written data, and decoding, where data is reconstructed after failures. This paper focuses on improving the performance of encoding, the more frequent operation. It does so by scheduling the operations of XOR-based erasure codes to optimize their use of cache memory. We call the technique XOR-scheduling and demonstrate how it applies to a wide variety of existing erasure codes. We conduct a performance evaluation of scheduling these codes on a variety of processors and show that XOR-scheduling significantly improves upon the traditional approach. Hence, we believe that XOR-scheduling has great potential to have wide impact in practical storage systems.
Date of Conference: 29 June 2009 - 02 July 2009
Date Added to IEEE Xplore: 29 September 2009
ISBN Information:

ISSN Information:

Conference Location: Lisbon, Portugal

Contact IEEE to Subscribe

References

References is not available for this document.