GRID codes: Strip-based erasure codes with high fault tolerance for storage systems


As storage systems grow in size and complexity, they are increasingly confronted with concurrent disk failures together with multiple unrecoverable sector errors. To ensure high data reliability and availability, erasure codes with high fault tolerance are required. In this article, we present a new family of erasure codes with high fault tolerance, named GRID codes. They are called such because they are a family of <i>strip-based codes</i> whose strips are arranged into multi-dimensional grids. In the construction of GRID codes, we first introduce a concept of <i>matched codes</i> and then discuss how to use matched codes to construct GRID codes. In addition, we propose an iterative reconstruction algorithm for GRID codes. We also discuss some important features of GRID codes. Finally, we compare GRID codes with several categories of existing codes. Our comparisons show that for large-scale storage systems, our GRID codes have attractive advantages over many existing erasure codes: (a) They are completely XOR-based and have very regular structures, ensuring easy implementation; (b) they can provide up to 15 and even higher fault tolerance; and (c) their storage efficiency can reach up to 80&percnt; and even higher. All the advantages make GRID codes more suitable for large-scale storage systems.

DOI: 10.1145/1480439.1480444

Extracted Key Phrases

14 Figures and Tables


Citations per Year

60 Citations

Semantic Scholar estimates that this publication has 60 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Li2009GRIDCS, title={GRID codes: Strip-based erasure codes with high fault tolerance for storage systems}, author={Mingqiang Li and Jiwu Shu and Weimin Zheng}, journal={TOS}, year={2009}, volume={4}, pages={15:1-15:22} }