Partial repeat code construction method based on graph factorization

A technology of factorization and construction method, applied in the computer field, can solve problems such as single construction method, complex FR code construction process, inability to flexibly select construction parameters and data block repetition, and achieve the effect of flexible construction method

Pending Publication Date: 2019-12-03
CHANGAN UNIV
View PDF6 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] The purpose of the present invention is to provide a construction method of partial repetition codes based on graph factorization, which solves the problems in the prior art that the construction process of FR codes is complicated, the construction method is single, and the construction parameters and the repetition degree of data blocks cannot be flexibly selected.

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
  • Partial repeat code construction method based on graph factorization
  • Partial repeat code construction method based on graph factorization
  • Partial repeat code construction method based on graph factorization

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0037] This embodiment provides a partial repetition code construction method based on graph factorization, including the following steps:

[0038] Step 1: Use graph factorization method to complete graph K of order 6 6 Carry out 1 graph factorization to get F 1 , F 2 ,...,F 5 5 factors, each factor contains 3 edges, each edge has 2 vertices.

[0039] Step 2: Determine the repetition degree ρ (1≤ρ≤5) of constructing the FR code, for example, take ρ=3, so there are a total of A construction method of FR codes with repetition degree ρ=3 from F 1 , F 2 ,...,F 5 Choose 3 factors arbitrarily in , and put the 6th-order complete graph K 6 Each vertex v of i (1≤i≤6) as a data block v stored in FR code i (1≤i≤6), such as figure 1 As shown, the selection factor F 2 , F 4 , F 5 , then for F 2 , F 4 , F 5 The edges are sequentially numbered as e q (1≤q≤9), such as figure 1 shown. Then, take each edge e of the 3 factors q (1≤q≤9) as each storage node N of FR code q (1...

Embodiment 2

[0041] This embodiment provides a partial repetition code construction method based on graph factorization, including the following steps:

[0042] Step 1: Use graph factorization method to complete graph K of order 9 9 Perform 2-graph factorization to get F 1 , F 2 ,...,F 4 4 factors, each factor contains 3 triangles.

[0043] Step 2, determine the repetition degree ρ' (1≤ρ'≤4) of constructing the FR code, take ρ'=3, so there are a total of A method for constructing FR codes with repetition degree ρ'=3. in F 1 , F 2 ,...,F 4 The Chinese party chooses 3 factors to construct, for example, select factor F 1 , F 3 , F 4 , then for F 1 , F 3 , F 4 The triangles are sequentially numbered as Δ q (1≤q≤9), such as image 3 shown. Take each triangle Δ in the 3 factors q (1≤q≤9) as each storage node N of FR code q (1≤q≤9), each node N q (1≤q≤9) store each triangle Δ q (1≤q≤9) data block d on adjacent vertices i (1≤i≤9). The capacity of each storage node of the FR ...

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 partial repeat code construction method based on graph factorization, which mainly comprises the following steps: step 1, taking each vertex vi (i is more than or equal to 1and less than or equal to n) of an n-order complete graph G as a data block di (i is more than or equal to 1 and less than or equal to n) stored by a partial repeat code, and then carrying out graph factorization on the n-order complete graph G; 2, determining the repetition degree rho for constructing the FR code, numbering the edges or triangles of the selected factors in sequence according to the factorization of one factor or the factorization of two factors, and then taking each edge or triangle as each storage node of the FR code, wherein in the constructed FR code with the repetition degree of rho, each node stores a data block di (1 < = i < = n) on each edge or an adjacent vertex of each triangle. According to the method, the construction parameters and the repetition degree of thedata blocks can be selected in a large range, and the construction method has the characteristic of diversity.

Description

technical field [0001] The invention belongs to the field of computers and relates to a construction algorithm of a partial repetition code based on graph factorization. Background technique [0002] In distributed storage systems, Rouayheb and Ramchandran proposed a Fractional Repetition (FR) code for accurate repair in 2010. FR codes can tolerate low-complexity code-free repair of multiple faulty nodes, reduce repair bandwidth overhead and disk I / O overhead, and significantly improve system fault repair performance. However, there are problems in that the construction process of FR codes is complicated, the method of constructing FR codes is single, and the construction parameters and the repetition degree of data blocks cannot be flexibly selected. Contents of the invention [0003] The purpose of the present invention is to provide a construction method of partial repetition codes based on graph factorization, which solves the problems in the prior art that the constr...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06F11/10
CPCG06F11/1012
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