GRID codesстатья из журнала
Аннотация: 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 strip-based codes whose strips are arranged into multi-dimensional grids. In the construction of GRID codes, we first introduce a concept of matched codes 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% and even higher. All the advantages make GRID codes more suitable for large-scale storage systems.
Год издания: 2009
Авторы: Mingqiang Li, Jiwu Shu, Weimin Zheng
Издательство: Association for Computing Machinery
Источник: ACM Transactions on Storage
Ключевые слова: Advanced Data Storage Technologies, Caching and Content Delivery, Error Correcting Code Techniques
Открытый доступ: closed
Том: 4
Выпуск: 4
Страницы: 1–22