Unlock instant, AI-driven research and patent intelligence for your innovation.

Matrix construction method of symmetric partial repeat codes and fault node repair method

A symmetric part and construction method technology, applied in the computer field, can solve the problems of complex repetitive code construction method, small node repair selectivity, and large repair locality, and achieves extremely easy promotion, simple construction process, and small repair locality. Effect

Active Publication Date: 2020-02-11
CHANGAN UNIV
View PDF3 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The purpose of the present invention is to provide a matrix construction method of a symmetrical partial repetition code and a faulty node repair method to solve the complex construction method of a partial repetition code in the prior art , In the process of node repair, the repair locality is large, the fault tolerance is small, and the node repair selectivity is small.

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
  • Matrix construction method of symmetric partial repeat codes and fault node repair method
  • Matrix construction method of symmetric partial repeat codes and fault node repair method
  • Matrix construction method of symmetric partial repeat codes and fault node repair method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0027] In this embodiment, a matrix construction method of a symmetrical partial repetition code is disclosed, and the method is suitable for a construction scheme with a coding block repetition degree of 3, including the following steps:

[0028] Step 1: Divide the original file into k original data blocks, perform (n,k) MDS encoding on the k original data blocks, and obtain n coded blocks C 1 ,C 2 ,...,C n , where n≥4 and n, k are positive integers;

[0029] Step 2: Construct n-order claw matrix s 1 , according to s 1 Construct n-order adjustment matrix s 2 ;

[0030] Step 3: The n-order matrix s 1 and the n-order adjustment matrix s 2 The elements in the corresponding positions are logically added to obtain the n-order correlation matrix s of the symmetrical partial repetition code. The row of the correlation matrix s represents the node, and the column of the correlation matrix s represents the coding block, s ij Indicates the elements in s, if s ij = 1, then the ...

Embodiment 2

[0042] This embodiment discloses a method for constructing a matrix of a symmetrical partial repetition code. On the basis of Embodiment 1, a storage scheme for five coding blocks with a repetition degree of 3 in a distributed storage system including five storage nodes is given .

[0043] Such as figure 1 As shown, to store a file with a size of 4M in the distributed storage system, first perform (5, 4) MDS encoding on the original file, and then represent the five encoded blocks as 1, 2, 3, ... 5. Remove the fifth-order claw matrix s 1 The last row and last column of , get a matrix s with 4 rows and 4 columns 3 , in the matrix s 3 Add a zero element at the end of the last row of elements, that is, the row vector m=(1 11 0 0), and use the row vector m as the adjustment matrix s 2 The first row of elements. Next, shift the elements of the row vector m to the right one by one, that is, put {0, 1, 1, 1, 0} in the adjustment matrix s 2 the second line of the . will matrix ...

Embodiment 3

[0047] This embodiment discloses a method for constructing a matrix of a symmetrical partial repetition code. On the basis of Embodiment 1, a storage scheme for six coding blocks with a repetition degree of 3 in a distributed storage system including six storage nodes is given. .

[0048] Such as image 3 As shown, a file with a size of 5M is stored in the distributed storage system, and (6, 5) MDS encoding is performed on the file, and these 5 encoding blocks are represented by 1, 2, 3, ... 6. Remove the 6-order claw matrix s 1 The last row and last column of , get a matrix s with 5 rows and 5 columns 3 , in the matrix s 3 Add a zero element at the end of the last row of elements and record it as a row vector m=(1 1 1 1 0 0), and use the row vector m as the adjustment matrix s 2 The first row of elements. Next, shift the elements of m to the right one by one, that is, put {0, 1, 1, 1, 1, 0} in the adjustment matrix s 2 the second line of the . put the matrix s 2 The e...

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 belongs to the field of computers, and discloses a matrix construction method of symmetrical partial repeat codes and a fault node repair method. The matrix construction method of the symmetric partial repeat code mainly comprises the following steps: constructing an adjustment matrix S2 according to a claw-shaped matrix S1, and adding elements at corresponding positions of the claw-shaped matrix S1 and the adjustment matrix S2 to obtain an incidence matrix s of the symmetric partial repeat code, thereby completing the matrix construction of the symmetric partial repeat code. Thesystem storage rate of the constructed symmetric partial repeat code is high, and multiple repair schemes with the repair degree of 2 are provided for repairing a single fault node. And when any twonodes fail, a repair scheme that the repair degree of the nodes is 2 also exists. Compared with a traditional partially repeated code, the disk I / O overhead is relatively small during node repair, faults of two nodes can be resisted, and the code is simple in construction process, extremely easy to popularize and high in operability.

Description

technical field [0001] The invention belongs to the field of computers, and in particular relates to a method for constructing a matrix of a symmetrical partial repetition code and a method for repairing faulty nodes. Background technique [0002] The mass quantization of information data makes the scale of distributed storage systems larger. In order to ensure the availability and reliability of data, storage systems usually use "replication" and "erasure code" strategies to generate redundant data, while "replication" redundancy strategies The resulting storage cost is too high; although the erasure code can optimize the storage overhead of the distributed storage system, the entire file must be restored in the process of repairing a single faulty node, and the bandwidth overhead is too large. Aiming at the limitations of the "replication" and "erasure code" redundancy strategies, Dimakis et al. proposed a regenerative code, but the regenerative code connects a large numbe...

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
CPCG06F11/1076
Inventor 王静王秘余春雷刘艳
Owner CHANGAN UNIV
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

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

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com