L-Code: An Efficient Coding Scheme for Recovering Single Disk Failure

Abstract

In modern storage system, the reliability of the data is very important. In order to deal with the disk failures, researchers put forward many methods. Among them, one important implementation is erasure code. In erasure code scheme, there exist many disk failure problems, the most common one is single disk failure, it has been receiving more attention in recent years. In this paper, we present an efficient erasure code scheme which we named L-code, through the different placement and calculation of redundant elements, this scheme can improve the performance on single disk failure reconstruction. To demonstrate it, we did some experiments, the result show that L-code gains up to 34.4% higher recovery performance than optimized H-code and 42.7% for optimized EVENODD. In encoding complexity, our scheme also gains up to 1.9% than optimized H-code and 44.2% than optimized EVENODD.