Intersection reconstruction method based on erasure code cluster memory system

Abstract

The invention discloses an intersection reconstruction method based on an erasure code cluster memory system. The intersection reconstruction method based on the erasure code cluster memory system comprises the following steps: an I replacing node (RNi) initialize a reference value rowstep of a self strip number to zero; the RNi sends requests to arbitrary k survival nodes, acquires rowstep + I sticks of the k survival nodes, and respectively records B1, ..., Bk; the RNi uses the B1, ..., Bk to figure out f invalidated blocks of the rowstep + I sticks belonging to a cluster, and respectively records RB rowstep +I, 1, ..., RB rowstep + I , f; the RNi writes the invalidated blocks RB rowstep + I, I into a local disk, and the invalidated blocks RB rowstep + I, I becomes the rowstep + I sticks of the local. The intersection reconstruction method based on the erasure code cluster memory system is capable of reducing network bandwidth spending and accelerating reconstruction speed.

Description

technical field [0001] The invention belongs to the field of data storage, and more specifically relates to a cross reconstruction method based on an erasure code cluster storage system. Background technique [0002] With the development of computer technology and network technology, cluster storage systems need fault-tolerant technology with high storage utilization and high fault-tolerance rate to deal with the challenge of massive data on cluster reliability. Erasure code fault-tolerant technology has advantages in the above two aspects and has been paid more and more attention. [0003] The erasure code error-tolerant technology encodes the data through the erasure code algorithm to obtain a small amount of redundancy, and then stores the data and the redundancy together. like figure 1 As shown in , the disk space of each node is divided into stripes. The disk space of the entire cluster consists of independent stripes. Each strip calculates r redundant blocks from k...

AI Technical Summary

Problems solved by technology

[0005] Aiming at the defects of the prior art, the purpose of the present invention is to provide a crossover reconstruction method based on an erasure code cluster storage system, which aims to solve the problem of multiple nodes simultaneously appearing in the erasure code cluster storage system in the existing reconstruction method. Cause the problem of a large amount of network bandwidth expenses under the situation of invalidation, the method of the present invention divides the data that needs recovery into each replacement node, and each replacement node is only responsible for the recovery of a part of the strip, and the small amount of data that obtains after each reconstructs in two pairs Replacement nodes send and receive each other, which can reduce network bandwidth overhead and speed up reconstruction, while having high reliability and high scalability

Images