An efficient coding scheme for correcting triple storage node failures (2005)
| Venue: | in FAST-2005: 4th Usenix Conference on File and Storage Technologies |
| Citations: | 11 - 0 self |
BibTeX
@INPROCEEDINGS{Huang05anefficient,
author = {Cheng Huang},
title = {An efficient coding scheme for correcting triple storage node failures},
booktitle = {in FAST-2005: 4th Usenix Conference on File and Storage Technologies},
year = {2005},
pages = {197--210}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Proper data placement schemes based on erasure correcting code are one of the most important components for a highly available data storage system. For such schemes, low decoding complexity for correcting (or recovering) storage node failures is essential for practical systems. In this paper, we describe a new coding scheme, which we call the STAR code, for correcting triple storage node failures (erasures). The STAR code is an extension of the double-erasure-correcting EVENODD code, and a modification of the generalized triple-erasure-correcting EVENODD code. The STAR code is an MDS code, and thus is optimal in terms of node failure recovery capability for a given data redundancy. We provide detailed STAR code’s decoding algorithms for correcting various triple node failures. We show that the decoding complexity of the STAR code is much lower than those of the existing comparable codes, thus the STAR code is practically very meaningful for storage systems that need higher reliability. 1
