Block construction-based partial repeat code construction method and fault node repair method
A construction method and technology of faulty nodes, applied in the computer field, can solve the problems of large locality of node repair and complex construction method of repetitive codes, and achieve the effects of easy popularization, simple construction process and simple operation.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0029] In this embodiment, a partial repetition code construction method based on block construction is disclosed, figure 1 A storage scheme of 10 coded blocks with m=4 storage nodes and a repetition degree of 2 in the distributed storage system is given.
[0030] To store a file with a size of 7M in a distributed storage system, first perform (4*5 / 2=10,7) MDS encoding on the original file, and then represent the 10 encoded blocks as 1, 2, 3, ... 10 . will encode block C 10 The subscript 10 is decomposed into 10-1, that is, 9 and 1, and the coding block C 9 The subscript 9 is decomposed into 10-1-2, that is, 7 and 2, and the coding block C 7 The subscript 7 decomposes into 10-1-2-3 i.e. 4 and 3, but the coding block C 4 The subscript 4 cannot be further decomposed, because 1, 3, and 2 have all appeared. Then the remaining coding block C 5 , C 6 , C 8 The subscripts 5, 6, and 8 of are arranged in ascending order, so that the first line stores a coding block C 10 The su...
Embodiment 2
[0033] In this embodiment, a partial repetition code construction method based on block construction is disclosed, figure 2 A storage scheme of 15 coded blocks with m=5 storage nodes and a repetition degree of 2 in the distributed storage system is given.
[0034] To store a file with a size of 12M in a distributed storage system, first perform (5*6 / 2=15,12) MDS encoding on the original file, and then represent the 15 encoded blocks as 1, 2, 3, ... 15 . will encode block C 15 The subscript 15 is decomposed into 15-1, that is, 14 and 1, and the coding block C 14 The subscript 14 is decomposed into 15-1-2, that is, 12 and 2, and the coding block C 12 The subscript 12 is decomposed into 15-1-2-3 that is 9 and 3, and the coding block C 9 The subscript 9 decomposes into 15-1-2-3-4 i.e. 5 and 4, but the coding block C 5 The subscript 5 cannot be further decomposed, because 1, 4, 3, and 2 have all appeared. Then the remaining coding block C 6 , C 7 , C 8 , C 10 , C 11 , C...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com