An n-code-based raid6 disk array expansion method and data filling method
A disk array and disk technology, applied in the direction of digital data processing, data processing input/output process, instruments, etc., can solve the problems of the design complexity of the expansion scheme, neglect the performance of the storage system, and the large expansion cost, so as to maintain the code Advantages, improve the efficiency of capacity expansion, the effect of expanding capacity
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0086] Example 1 Transfer the N-Code from the old disk array p 0 =5 for the first (k=1) expansion, expand to p 1 =7.
[0087] The first step is to insert a new disk; such as Image 6 shown, 2 new disks (n=p 1 -p 0 =2) Add to the old disk array, the disk number d of the 0th (j=0) new disk 0 =(5+1) / 2+0=3, the disk number d of the first (j=1) new disk 1 =(5+1) / 2+1=4, so the disk number of the 0th new disk in the new disk array is D 3 , the disk number of the first new disk in the new disk array is D 4 ;
[0088] After the new disk is added, adjust the disk number of each old disk in the old disk array according to formula (1). The first three disk numbers in the old disk array are D. 0 , D 1 and D 2 unchanged, the rest are based on the old disk number + n respectively, so D 3 , D 4 and D 5 Respectively adjusted to D 5 , D 6 and D 7 , get a new disk array;
[0089] The second step is to adjust the coding array;
[0090] Detect and record the number of blank block...
Embodiment 2
[0102] Example 2 Transfer the N-Code from the old disk array p 0 =5 for the first (k=1) expansion, expand to p 1 =7; the first step is the same as in Example 1;
[0103] The second step is to adjust the coding array;
[0104] Detect and record the number of blank blocks per disk in the new disk array B i ,save at Figure 7 In the array shown, traverse the array to find the disk d with the least number of blank blocks in the new disk array min , disk d min The number of blank blocks is denoted as B min ;
[0105] Calculate the expansion threshold CT; the number of stripes S added to each encoding array after adding a new disk ad 2 stripes, the total number of stripes per encoded array after adding a new disk S 1 is 6, and the expansion threshold can be calculated from formula (2) to be C / 3;
[0106] will B min Compared with CT, it is assumed that in Example 2, the blank stripe of the disk array is CTmin ≤B, choose LBBO:
[0107] Step 1. Standardize the coding array: ...
PUM

Abstract
Description
Claims
Application Information

- R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
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