Efficient Array Coding Scheme for Large-Scale Storage Systems

作     者：Dan Tang Dan Tang;Software Engineering College,Chengdu University of Information Technology

作者机构：Software Engineering CollegeChengdu University of Information Technology 

出 版 物：《Journal of Electronic Science and Technology》 (电子科技学刊（英文版）)

年 卷 期：2015年第13卷第2期

页      面：102-106页

核心收录：

学科分类：08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by the National Natural Science Foundation of China under Grant No.61202250 

主　　题：codes decoding dynamically parity restricted sector encoding operations running correcting 

摘      要：A family of array codes with a maximum distance separable（MDS） property, named L codes, is proposed. The greatest strength of L codes is that the number of rows（columns） in a disk array does not be restricted by the prime number, and more disks can be dynamically appended in a running storage system. L codes can tolerate at least two disk erasures and some sector loss simultaneously, and can tolerate multiple disk erasures（greater than or equal to three） under a certain condition. Because only XOR operations are needed in the process of encoding and decoding, L codes have very high computing efficiency which is roughly equivalent to X codes. Analysis shows that L codes are particularly suitable for large-scale storage systems.