System minimum storage regeneration code based local repair encoding method

A technology of storage regeneration and coding method, which is applied in the field of local repair coding, and can solve problems such as not considering node storage overhead

Inactive Publication Date: 2016-01-20
CHANGAN UNIV
View PDF4 Cites 29 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although the existing localized repair coding has low disk I/O overhead, the existing localiz

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • System minimum storage regeneration code based local repair encoding method
  • System minimum storage regeneration code based local repair encoding method
  • System minimum storage regeneration code based local repair encoding method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0071] This embodiment is to construct (7,4 system) system MSR code in finite field GF(8), using m=[m 1 m 2 m 3 m 4 ] Represents the original information data of the storage node in the distributed storage system, where m 1 ,m 2 ,...,M 4 Indicates information symbol; c=[c 1 c 2 …C 7 ] Represents the generated codeword of the system MSR code stored in the distributed storage node, and c=m·G MSR , Here (7,4) system MSR code generator matrix G MSR =[I|P] 4×7 , Where I is a 4×4 unit matrix, and P is a 4×3 dimensional sub-matrix. (7,4) The system MSR code can be expressed as

[0072] c=m·G MSR =m·[I|P] 4×7 =[m|mP]

[0073] (7,4) The structure of the system MSR code can be expressed as:

[0074] Storage node

m

mP

[0075] Let α 1 ,α 2 ,α 3 Is the 3 non-zero elements in GF(8), then the generator matrix of the (7,4) system MSR code is

[0076] G M S R = [ I | P ] 4 X 7 = 1 0 0 0 1 1 1 0 1 0 0 ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a system minimum storage regeneration code based local repair encoding method. The local repair encoding method comprises: constructing a storage structure and a generation matrix of a system minimum storage regeneration code; establishing a local repair encoding structure based on the system minimum storage regeneration code; and repairing a single-node fault, a two-non-adjacent-node fault and a two-adjacent-node fault in a repair group by adopting the established local repair encoding structure. According to the local repair encoding method, the system minimum storage regeneration code is adopted as a local code, and storage nodes store original data copies, so that the disk I/O expenditure and the bandwidth repair expenditure in a storage node repair process are reduced; and a redundant data part in the storage nodes is generated by minimum storage regeneration encoding data parts of two successive storage nodes, and based on the encoding structure, when the single-node fault, the two-adjacent-node fault and the two-non-adjacent-node fault exist in the repair group, fault node data reconstruction can be quickly realized through the successive nodes to recover fault node data.

Description

Technical field [0001] The invention belongs to the computer field, and relates to a local repair coding method based on the minimum storage and regeneration code of the system. Background technique [0002] Distributed storage systems usually use "replication" and "erasure coding" strategies to generate redundant data to ensure the reliability and availability of data storage. However, the "replication" redundancy strategy is too costly to store, and a large amount of duplicate data needs to be stored to ensure high system reliability. The "erasure code" strategy requires too much bandwidth overhead during node repair, requiring a storage system with a higher network bandwidth. In view of the limitations of "copy" and "erasure code" redundancy strategies, Dimakis et al. proposed regeneration codes, including Minimum Storage Regenerating (MSR) codes and Minimum Bandwidth Regenerating (MBR) codes, but regeneration codes In the process of repairing a faulty node, there are a larg...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F11/10
Inventor 王静段宗涛杨洋
Owner CHANGAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap