Method for constructing an adaptive decomposable partial repetition code based on a hypergraph
A construction method and repetition code technology, applied in the computer field, can solve problems such as high computational complexity, and achieve the effects of reducing computational complexity, optimizing repair locality, and reducing repair time
Active Publication Date: 2019-03-26
CHANGAN UNIV
View PDF4 Cites 5 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
[0004] Aiming at the problems that the self-adaptive decomposable partial repetition codes in the prior art involve a large number of finite field operations, the computational complexity of the construction process is relatively high, and the existence of the self-adaptive decomposable partial repetition codes is limited by conditions, the present invention provides A hypergraph-based self-adaptive decomposable partial repetition code construction method, comprising the following steps:
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 moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0074] This embodiment specifically illustrates a hypergraph-based self-adaptive decomposable partial repetition code construction method and a fault repair method.
[0075] Step 1: Construct a dyed linear consistent regular hypergraph through the method of hypergraph dyeing, that is, a dyed linear (d, ρ)-hypergraph;
[0076] Step 1.1: Assume that in the hypergraph G=(V,E), the vertex set V={v 1 ,v 2 ,...,v 16}, link set E={e 1 ,e 2 ,...,e 12}, each link contains 4 vertices, and each vertex exists in 3 links;
[0077] Step 1.2: If figure 1 As shown, the vertex set V is divided into four vertex subsets according to the sequence, which are V 1 ={v 1 ,v 2 ,v 3 ,v 4}, V 2 ={v 5 ,v 6 ,v 7 ,v 8}, V 3 ={v 9 ,v 10 ,v 11 ,v 12}, V 4 ={v 13 ,v 14 ,v 15 ,v 16}, divide the link set E into three link subsets E in sequence 1 ={e 1 ,e 2 ,e 3 ,e 4},E 2 ={e 5 ,e 6 ,e 7 ,e 8},E 3 ={e 9 ,e 10 ,e 11 ,e 12};
[0078] Step 1.3: According to the heuristic co...
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
Login to View More Abstract
The invention belongs to the field of computers, and particularly relates to a method for constructing an adaptive decomposable partial repetition code based on a hypergraph, comprising the followingsteps: Step 1: constructing a linear (d, Rho) supergraph of dyeing by a method of hypergraph dyeing The dyed linear (d, Rho)-hypergraph contains vertices and staining links; Step 2: Determining the linearity of the staining (d, Rho)-The vertices in the hypergraph and the stained links and nodes and data in the FR code The correspondence between the blocks yields the coding structure of the FR code. The method enables the FR code to flexibly adapt to the dynamic distributed storage system, and effectively reduces the computational complexity of the FR code encoding process. The invention also includes a FR code fault repairing method based on hypergraph, which can quickly realize data reconstruction of a faulty node through a limited surviving node, thereby effectively reducing the repairing time in the repairing process.
Description
technical field [0001] The invention belongs to the field of computers, and in particular relates to a hypergraph-based self-adaptive decomposable partial repetition code construction and a fault repair method. Background technique [0002] With the emergence of massive data and the explosive growth of information data, distributed storage systems have been widely used because of their low cost and high scalability. In distributed storage systems, people generally pursue the reliability and availability of data storage. [0003] Initially, the three-copy replication strategy and erasure codes were adopted to improve system reliability, but the storage cost of the replication strategy was too high, and the repair bandwidth overhead of erasure codes was too large. Subsequently, Dimakis et al. proposed regenerative codes, which significantly reduced the repair bandwidth overhead of faulty nodes. By analyzing the repair bandwidth and storage overhead, Dimakis et al. proposed a...
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
Login to View More Patent Type & Authority Applications(China)
IPC IPC(8): G06F11/10H03M13/37
CPCH03M13/373G06F11/1076
Inventor 王静王甜甜王淑霞张雪飞
Owner CHANGAN UNIV