Improved decoding algorithm for the generalized EVENODD array code

Data placement scheme based on the generalized EVENODD array code was one of the most important choices for data storage systems to tolerate failures. The efficiency of the erasure code was directly related to the number of XOR operations during the encoding and decoding. We provided an improved dec...

Full description

Saved in:
Bibliographic Details
Published in2012 2nd International Conference on Computer Science and Network Technology pp. 2216 - 2219
Main Authors Haibo, Jiang, Mingyu, Fan, Yilong, Xiao, Xiaojing, Wang, Yu, Wu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2012
Subjects
Arrays
Codes
data placement
Decoding
decoding algorithm
Distributed databases
Encoding
erasure code
Mathematical models
Peer-to-peer computing
Software
Software algorithms
Symbols
XOR operations
Online AccessGet full text
ISBN1467329630
9781467329637
DOI10.1109/ICCSNT.2012.6526358

Cover

More Information
Summary:Data placement scheme based on the generalized EVENODD array code was one of the most important choices for data storage systems to tolerate failures. The efficiency of the erasure code was directly related to the number of XOR operations during the encoding and decoding. We provided an improved decoding algorithm of the generalized EVENODD array code for correcting various triple node failures. It showed that the decoding complexity of the new algorithm was much lower than those of the existing comparable algorithm, thus it made the generalized EVENODD array code more efficiency in storage systems.
ISBN:1467329630
9781467329637
DOI:10.1109/ICCSNT.2012.6526358