Flexible Parameterization of XOR based Codes for Distributed Storage

Peter Sobe, Kathrin Peter


Distributed storage systems apply erasure-tolerant codes to guarantee reliable access to data despite failures of storage resources. While many codes can be mapped to XOR operations and efficiently implemented on common microprocessors, only a certain number of codes are usually implemented in a certain system (out of a wide variety of different codes). The ability to include new codes easily, to exchange codes and finally to select codes for several types of data is desirable. To provide this flexibility, a parameterization is used which allows the definition of different XOR based codes, and beyond different styles of en- and decoding. The parameters include (i) the assignment of data and redundancy elements to the storage resources and (ii) a description of en- and decoding algorithms with XOR based equations. The parameters of a certain code can be changed and in addition a wide variety of codes can be described and included in a storage system implementation. The proposed parameterization adopts the ability of codes like EVEN-ODD, Cauchy-R/S and HoVer codes to map to distributed resources. Furthermore, en- and decoding algorithms can be described differently, either for minimal coding cost or for minimal coding time on parallel systems.

Original languageEnglish
Title of host publication 2008 Seventh IEEE International Symposium on Network Computing and Applications
Number of pages10
Publication date19.09.2008
Article number4579645
ISBN (Print)978-0-7695-3192-2
Publication statusPublished - 19.09.2008
Event7th IEEE International Symposium on Networking Computing and Applications - Cambridge, United States
Duration: 10.07.200812.07.2008
Conference number: 73523


Dive into the research topics of 'Flexible Parameterization of XOR based Codes for Distributed Storage'. Together they form a unique fingerprint.

Cite this