Abstract

Array erasure coding technology is one of the most desirable methods to enhance the reliability of storage systems, but fault tolerance is always the bottleneck to the use of array codes. There are several improvement schemes for fault tolerance of array codes now, such as graph theory method, hybrid layout method, and so on. But improvement of the fault tolerance is pretty small, and always cost too much. In view of this, the paper presents a new method to improve fault tolerant ability of array erasure codes. The new method has a highly computing efficiency because all calculations are binary XOR operations, and it is convenient to implement because of its simple construction. Using this new method, we can model a horizontal array code with the optimal updating expenses. Although MDS array codes cannot be modeled by the new method, but storage efficiency can be improved by increasing the strip size. The most important contribution of this paper is that, this new method can construct an array erasure code which has the unconstrained fault tolerant ability in theory.

Highlights

  • At present, the data generated by all sectors of industries is growing explosively

  • To deal with the storage reliability problem caused by the rapid growth of the data quantity, an effective method is to build a storage system using multiple independent storage nodes together besides the simple expansion of the storage node capacity

  • We use the number of storage nodes to represent the scale of a storage system

Read more

Summary

Introduction

To deal with the storage reliability problem caused by the rapid growth of the data quantity, an effective method is to build a storage system using multiple independent storage nodes together besides the simple expansion of the storage node capacity. This method can effectively increase the storage capacity, enhance the system reliability, improve the data parallel access efficiency and reduce the cost of storage system construction In this case, we use the number of storage nodes to represent the scale of a storage system. The organizational structure of this paper is as follows: In the first chapter, some general concepts in the fault tolerant area are given, and some common methods of improving the fault tolerance of array codes are presented. The second chapter will give a new method to improve the fault tolerance of array codes, as well as restrictions.

Basic concepts
Fault tolerance enhancement method based on coding chains
Basic encoding and decoding method
Findings
Performance analysis
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call