CN111782439B - Double-disk circulation verification method based on horizontal coding - Google Patents
Double-disk circulation verification method based on horizontal coding Download PDFInfo
- Publication number
- CN111782439B CN111782439B CN202010655155.4A CN202010655155A CN111782439B CN 111782439 B CN111782439 B CN 111782439B CN 202010655155 A CN202010655155 A CN 202010655155A CN 111782439 B CN111782439 B CN 111782439B
- Authority
- CN
- China
- Prior art keywords
- check
- data
- disk
- mapping table
- stripe
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
- G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
- G06F11/1076—Parity data used in redundant arrays of independent storages, e.g. in RAID systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G06F11/1458—Management of the backup or restore process
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0614—Improving the reliability of storage systems
- G06F3/0619—Improving the reliability of storage systems in relation to data integrity, e.g. data losses, bit errors
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/064—Management of blocks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0683—Plurality of storage devices
- G06F3/0689—Disk arrays, e.g. RAID, JBOD
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The invention discloses a double-disk circulation checking method based on horizontal coding, which comprises the following steps that the layout of the horizontal coding consists of N disks, wherein N-2 data disks and 2 checking disks are arranged; all the magnetic disks are striped, the data blocks and the check blocks which are positioned in the same row form one stripe, and m stripes are formed in a conformal mode. Constructing a mapping table in the storage system, wherein corresponding values in the mapping table represent positions of check values in strips with the same offset; setting the same initial value for all marks in the mapping table, wherein the initial value represents the current check value and is stored in a second check disk; when a write request arrives, dividing write request data into a plurality of parts according to the size of a data block, performing data write operation by taking a stripe as a unit, generating a check value and storing the check value into a corresponding check disk; after each new check value is stored, the mark corresponding to the current strip in the mapping table is inverted, and the mark is updated; after all the stripes are written, all the final check values are merged.
Description
Technical Field
The invention belongs to the field of data storage, and particularly relates to a double-disk circulation verification method based on horizontal coding.
Background
With the rapid development of the Internet and the arrival of the big data age, the network data information presents an explosive growth trend, and the high-efficiency storage, management and use of the data are already the problems to be solved urgently in the Internet and related industries, which provide a great challenge for the performance of the network storage system. Nowadays, network storage systems are greatly improved in terms of storage capacity, data availability, I/O performance and the like, and network storage is increasingly used in various industries. Currently, the mainstream network storage technologies mainly include three types: direct connection storage (Directed Attached Storage), attached network storage (Network Attached Storage) and storage area network (Storage Area Network), each of which has respective application fields.
The rapid development of storage demands has led industry to place higher demands on disk capacity, energy savings, etc., and for this reason Chen P M, lee E K, gibson G A et al have proposed RAID techniques RAID: high-performance, reliable secondary storage [ J ]. Acm Computing Surveys,1994,26 (2): 145-185. However, with the development of big data, the conventional RAID technology has only one check disk, has an inherent disadvantage in terms of frequent reading and writing of the disk, and is not suitable for a storage environment where specific data is frequently accessed. The data needs to be checked by the check disk at any time when the data disk is frequently read and written, and the read-write speed of the check disk becomes a bottleneck of data storage, especially in a system with frequent read-write of an application program, a network game and the like with strong interactivity, which is particularly serious.
Disclosure of Invention
Aiming at the defects of the prior art, the invention aims to provide a double-disk circulation checking method based on horizontal coding.
The technical scheme for solving the technical problems is that a double-disk circulation checking method based on horizontal coding is provided, and the method is characterized by comprising the following steps:
(1) The layout of the horizontal code consists of N magnetic disks, wherein the N magnetic disks comprise N-2 data disks and 2 check disks; n >2; dividing each data disk into m data blocks with equal size; each check disc is divided into m check blocks with the same size as the data blocks; striping all the magnetic disks, forming a stripe by the data blocks and the check blocks which are positioned in the same row, and forming m stripes in a conformal way; the data discs work in parallel, and the stripes work sequentially; m is more than or equal to 1;
(2) Constructing a mapping table in a storage system based on the layout, wherein corresponding values in the mapping table represent positions of check values in stripes with the same offset; setting the same initial value for all marks in the mapping table, wherein the initial value represents the current check value and is stored in a second check disk;
when a write request arrives, dividing write request data into a plurality of parts according to the size of a data block, performing data write operation by taking a stripe as a unit, generating a check value and storing the check value into a corresponding check disk; after each new check value is stored, the mark corresponding to the current strip in the mapping table is inverted, and the mark is updated; until all the strips are full;
(3) After all the stripes are written, all the final check values are merged.
Compared with the prior art, the invention has the beneficial effects that:
1. and the read-write speed of the data is improved. Because the conventional RAID architecture only comprises a single check disk, when new data is written, the old check value and the old data need to be read, and then the generated new data is written into the check disk, so that the delay caused by reading and writing the check disk can be greatly increased. According to the method, one check disk is added on the basis of the traditional RAID, double check disk operation is adopted, one check disk is used for reading check data, the other check disk is used for writing check data, and the reading and writing bottlenecks of the check disks are effectively solved by division operation.
2. The dual-check disk operation with the function of dividing reading and writing is adopted, so that the performance of the storage system is greatly improved.
3. The mapping table occupies small space of the disk, and the influence caused by merging of the check disks is effectively reduced.
4. When one disk fails, the exclusive OR is carried out according to other data blocks and check blocks of the same strip in the whole RAID disk group, so that the reliability of the storage system is ensured.
Drawings
Fig. 1 is a schematic diagram of a dual disk cycle check flow in embodiment 1 of the present invention.
Fig. 2 is a schematic diagram of the initial values of the mapping table flags in embodiment 1 of the present invention.
FIG. 3 is a check block P of embodiment 1 of the present invention 0 Is provided with a local part in (a)And generating a schematic diagram by the check value.
FIG. 4 is a check block P of embodiment 1 of the present invention 0 The local check values in' generate a schematic.
FIG. 5 is a check block P of embodiment 1 of the present invention 0 The final check value in (2) generates a schematic diagram.
FIG. 6 is a check block P of embodiment 1 of the present invention 1 Final checksum P in (c) 2 The local check values in (a) are used to generate a schematic diagram.
Fig. 7 is a schematic diagram of mapping table marks generated after four write requests according to embodiment 1 of the present invention.
Detailed Description
Specific examples of the present invention are given below. The specific examples are provided only for further elaboration of the invention and do not limit the scope of the claims of the present application.
The invention provides a double-disk circulation checking method (method for short) based on horizontal coding, which is characterized by comprising the following steps:
(1) The layout of the horizontal code consists of N magnetic disks, wherein the N magnetic disks comprise N-2 data disks and 2 check disks; dividing each data disk into m data blocks with equal size for storing user data; each check disk is divided into m check blocks with the same size as the data blocks and used for storing check data; striping all the magnetic disks, forming a stripe by the data blocks and the check blocks which are positioned in the same row, and forming m stripes in a conformal way; the data discs work in parallel, and the stripes work sequentially; n >2; m is more than or equal to 1;
(2) Constructing a mapping table in a storage system based on the layout, wherein corresponding values in the mapping table represent positions of check values in stripes with the same offset; setting the same initial value for all marks in the mapping table, wherein the initial value is set to be 0 or 1, and the initial value represents the current check value and is stored in a second check disk;
when a write request arrives, dividing write request data into a plurality of parts according to the size of a data block, performing data write operation by taking a stripe as a unit, generating a check value and storing the check value into a corresponding check disk; after each new check value is stored, the mark corresponding to the current strip in the mapping table is inverted, and the mark is updated; until all the strips are full;
(3) After all the stripes are written, all the final check values are merged.
Preferably, step 2) is specifically: constructing a mapping table in a storage system based on the layout, wherein corresponding values in the mapping table represent positions of check values in stripes with the same offset; setting the same initial value for all marks in the mapping table, wherein the initial value is set to be 0 or 1, and the initial value represents the current check value and is stored in a second check disk;
dividing write request data into a plurality of parts according to the size of a data block, starting parallel writing of the divided write request data from the first data block of a first stripe, performing exclusive or on the newly written data and an initial value of a storage system to generate a check value, storing the check value into the first check disk, and inverting a mark corresponding to the current stripe in a mapping table;
the second write request comes, and whether the current stripe is full is judged; if the data block is not fully written, dividing the write request data into a plurality of parts according to the size of the data block, writing the divided write request data into idle data blocks adjacent to the last write request data, mutually exclusive-or-generating new check values between the newly written data and the check values already stored in the first check disk, storing the new check values into a second check disk, and reversing the marks corresponding to the current stripes in the mapping table; if the data block is full, starting writing from a first data block of a next stripe, performing exclusive OR on the newly written data and an initial value of a storage system to generate a check value of the stripe, storing the check value into a first check disk, and reversing a mark corresponding to the current stripe in a mapping table;
judging whether the current stripe is full or not when a third write request comes; if the write request is not full, dividing the write request data into a plurality of parts according to the size of the data block, writing the divided write request data into idle data blocks adjacent to the last write request data, mutually exclusive-or-generating new check values between the newly written data and the check values already stored in the second check disk, replacing the check value in the first check disk with the new check value when the first write request is performed, and inverting the mark corresponding to the current strip in the mapping table; if the data block is full, starting writing from a first data block of a next stripe, performing exclusive OR on the newly written data and an initial value of a storage system to generate a check value of the stripe, storing the check value into a first check disk, and simultaneously inverting a mark corresponding to the current stripe in a mapping table;
repeating the steps until all the strips are full.
Preferably, step 3) is specifically: determining the storage position of the final check value of each strip according to the updated mark of the mapping table; and finally, merging all final check values of all the strips into the same check disk, and removing the other check disk.
Preferably, in step 3), all the mapping table marks are summed, if the sum result is greater than 1/2 of the number m of marks, the final check value is merged into the second check disk, otherwise, into the first check disk.
Preferably, when a disk is damaged, original data in the damaged disk is lost, and at the moment, the damaged disk needs to be replaced by a new disk and data recovery is carried out, wherein the specific method for data recovery is as follows: and reading the data of the undamaged data disk and the check value of the undamaged check disk, wherein the result obtained by mutually exclusive-or of the data and the check value in the same stripe is recovery data, and storing the recovery data into a replaced new disk.
Example 1
(1) As shown in fig. 1, 6 disks are horizontally encoded, of which 4 data disks (D 0 ～D 3 ) And 2 parity disks (P and P'), each of which is divided into m data blocks of equal size, each of which is divided into m parity blocks of the same size as the data blocks, and the block size is set to 64KB for ease of understanding. The data blocks and the check blocks of the same row form a Stripe, and m stripes (Stripe 0 ～Stripe m-1 )；
The initial value of the storage system in this embodiment is 0, the initial values of all the flags in the mapping table are set to 0 (as shown in fig. 2), 0 represents that the current check value is P', and 1 represents that the current check value is P;
(2) The first write request comes, as shown in FIG. 3, with a data size of 128KB and a data size larger than the block size, so the data is divided into 2 parts and written to data block B 0,0 And B 1,0 In (B) 0,0 And B 1,0 The data in the data storage system and the initial value of the storage system are exclusive-or, and the generated check value is written into the check block P of the check disk P 0 
At this time, stripe in the mapping table is Stripe 0 The corresponding mark is inverted and updated to 1;
the second write request arrives, as shown in FIG. 4, with a data size of 54KB, a data size smaller than the block size, and the data is written to data block B 2,0 In (B) 2,0 Data and P in (3) 0 Writing the check value generated by exclusive OR into check block P of check disk P 0 '
At this time, stripe in the mapping table is Stripe 0 The corresponding flag is inverted and updated to 0;
the third write request arrives, as shown in FIG. 5, with a data block size of 24KB, a data size smaller than the block size, and data is written to data block B 3,0 In (B) 3,0 Data and P in (3) 0 The' mutually exclusive-or generated check values are written into the check blocks P of the check disc P 0 
Deleting the original check value and replacing the original check value with a new check value; at this time, stripe in the mapping table is Stripe 0 The corresponding mark is inverted and updated to 1;
since the fourth write request arrives with a data block size of 380KB and a data size larger than the block size, the data is divided into 6 parts and written to data block B 0,1 、B 1,1 、B 2,1 、B 3,1 、B 0,2 And B 1,2 In (B) 0,1 、B 1,1 、B 2,1 、B 3,1 Exclusive OR generation with initial value of memory systemWriting the resultant check value into the check block P of the check disk P 1 
Then B is arranged 0,2 、B 1,2 Check value generated by exclusive or with initial value of storage system is written into check block P of check disk P 2 />
At this time, stripe in the mapping table is Stripe 1 The corresponding mark is inverted and updated to 1; stripe in mapping table 2 The corresponding mark is inverted and updated to 1;
repeating the steps with other strips;
(3) After all the strips are fully written, merging the final check values; determining the storage location of the final check value for each Stripe based on the updated flags of the mapping table, where Stripe is according to FIG. 7 0 、Stripe 1 And strip 2 The corresponding flags are all 1, therefore, P 0 、P 1 And P 2 The final check value is stored in the memory; and finally, merging all final check values of all the strips into the same check disk, and removing the other check disk.
Suppose data disk D during storage 2 Failure or damage of D 2 At this time, a new disk D is used for losing the original data 2 ' replacement damaged disk D 2 And data recovery is carried out, and the specific method for data recovery is as follows: read B 0,0 、B 1,0 、B 3,0 Data and check block P in (a) 0 ' local check value in B 2,0 Data is composed of B 0,0 Data of B 1,0 Data of B 3,0 Data and check block P in (a) 0 Exclusive or of the local check values in' to derive
And calculate B 2,0 Data writing data disk D 2 ' data block B 2,0 Is a kind of medium. Data block B 2,1 ～B 2,n-1 Data recovery method of (a)The same applies.
The invention is applicable to the prior art where it is not described.
Claims (5)
1. A double-disk circulation checking method based on horizontal coding is characterized by comprising the following steps:
(1) The layout of the horizontal code consists of N magnetic disks, wherein the N magnetic disks comprise N-2 data disks and 2 check disks; n >2; dividing each data disk into m data blocks with equal size; each check disc is divided into m check blocks with the same size as the data blocks; striping all the magnetic disks, forming a stripe by the data blocks and the check blocks which are positioned in the same row, and forming m stripes in a conformal way; the data discs work in parallel, and the stripes work sequentially; m is more than or equal to 1;
(2) Constructing a mapping table in a storage system based on the layout, wherein corresponding values in the mapping table represent positions of check values in stripes with the same offset; setting the same initial value for all marks in the mapping table, wherein the initial value represents the current check value and is stored in a second check disk;
when a write request arrives, dividing write request data into a plurality of parts according to the size of a data block, performing data write operation by taking a stripe as a unit, generating a check value and storing the check value into a corresponding check disk; after each new check value is stored, the mark corresponding to the current strip in the mapping table is inverted, and the mark is updated; until all the strips are full;
(3) After all the stripes are written, all the final check values are merged.
2. The dual disk circulation checking method based on horizontal coding according to claim 1, wherein step 2) specifically comprises: constructing a mapping table in a storage system based on the layout, wherein corresponding values in the mapping table represent positions of check values in stripes with the same offset; setting the same initial value for all marks in the mapping table, wherein the initial value is set to be 0 or 1, and the initial value represents the current check value and is stored in a second check disk;
dividing write request data into a plurality of parts according to the size of a data block, starting parallel writing of the divided write request data from the first data block of a first stripe, performing exclusive or on the newly written data and an initial value of a storage system to generate a check value, storing the check value into the first check disk, and inverting a mark corresponding to the current stripe in a mapping table;
the second write request comes, and whether the current stripe is full is judged; if the data block is not fully written, dividing the write request data into a plurality of parts according to the size of the data block, writing the divided write request data into idle data blocks adjacent to the last write request data, mutually exclusive-or-generating new check values between the newly written data and the check values already stored in the first check disk, storing the new check values into a second check disk, and reversing the marks corresponding to the current stripes in the mapping table; if the data block is full, starting writing from a first data block of a next stripe, performing exclusive OR on the newly written data and an initial value of a storage system to generate a check value of the stripe, storing the check value into a first check disk, and reversing a mark corresponding to the current stripe in a mapping table;
judging whether the current stripe is full or not when a third write request comes; if the write request is not full, dividing the write request data into a plurality of parts according to the size of the data block, writing the divided write request data into idle data blocks adjacent to the last write request data, mutually exclusive-or-generating new check values between the newly written data and the check values already stored in the second check disk, replacing the check value in the first check disk with the new check value when the first write request is performed, and inverting the mark corresponding to the current strip in the mapping table; if the data block is full, starting writing from a first data block of a next stripe, performing exclusive OR on the newly written data and an initial value of a storage system to generate a check value of the stripe, storing the check value into a first check disk, and simultaneously inverting a mark corresponding to the current stripe in a mapping table;
repeating the steps until all the strips are full.
3. The dual disc circulation checking method based on horizontal coding according to claim 1, wherein the step 3) is specifically: determining the storage position of the final check value of each strip according to the updated mark of the mapping table; and finally, merging all final check values of all the strips into the same check disk, and removing the other check disk.
4. The dual disk cyclic check method based on horizontal coding according to claim 1, wherein in step 3), all mapping table marks are summed, if the sum result is greater than 1/2 of the number of marks m, the final check value is merged into the second check disk, otherwise, into the first check disk.
5. The dual disk cyclic check method based on horizontal coding as claimed in claim 1, wherein when the disk is damaged, the original data in the damaged disk is lost, and at this time, the damaged disk needs to be replaced by a new disk and data recovery is performed, and the specific method for data recovery is as follows: and reading the data in the undamaged data disk and the check value of the undamaged check disk, wherein the result obtained by mutually exclusive-or of the data in the same stripe and the check value is recovery data, and storing the recovery data into a replaced new disk.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010655155.4A CN111782439B (en) | 2020-07-09 | 2020-07-09 | Double-disk circulation verification method based on horizontal coding |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010655155.4A CN111782439B (en) | 2020-07-09 | 2020-07-09 | Double-disk circulation verification method based on horizontal coding |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111782439A CN111782439A (en) | 2020-10-16 |
| CN111782439B true CN111782439B (en) | 2023-06-06 |
Family
ID=72758384
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010655155.4A Active CN111782439B (en) | 2020-07-09 | 2020-07-09 | Double-disk circulation verification method based on horizontal coding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111782439B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112463040B (en) * | 2020-11-18 | 2022-07-08 | 苏州浪潮智能科技有限公司 | Data writing method and device, electronic equipment and storage medium |
| CN112905387B (en) * | 2021-03-04 | 2022-05-24 | 河北工业大学 | RAID6 encoding and data recovery method based on same |
| CN113297001B (en) * | 2021-05-20 | 2023-02-24 | 山东云海国创云计算装备产业创新中心有限公司 | RAID (redundant array of independent disks) coding and decoding method and coding and decoding circuit |
| CN113590042B (en) * | 2021-07-29 | 2024-03-19 | 杭州宏杉科技股份有限公司 | Data protection storage method, device and equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101504623A (en) * | 2009-03-20 | 2009-08-12 | 杭州华三通信技术有限公司 | Independent disk redundancy array construction method and device |
| CN102023819A (en) * | 2010-12-01 | 2011-04-20 | 北京同有飞骥科技股份有限公司 | Method for constructing double-disk fault tolerance horizontal grouping and parallel access disk array |
| CN105930099A (en) * | 2015-05-20 | 2016-09-07 | 德州学院 | Double-disc fault tolerant redundant array of independent disks capable of eliminating local parallel read-modify-write operation |
| CN106874141A (en) * | 2015-12-11 | 2017-06-20 | 中兴通讯股份有限公司 | A kind of fault-tolerance approach and IPTV system of data storage load |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10210063B2 (en) * | 2017-02-05 | 2019-02-19 | International Business Machines Corporation | Disk array storage controller |
-
2020
- 2020-07-09 CN CN202010655155.4A patent/CN111782439B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101504623A (en) * | 2009-03-20 | 2009-08-12 | 杭州华三通信技术有限公司 | Independent disk redundancy array construction method and device |
| CN102023819A (en) * | 2010-12-01 | 2011-04-20 | 北京同有飞骥科技股份有限公司 | Method for constructing double-disk fault tolerance horizontal grouping and parallel access disk array |
| CN105930099A (en) * | 2015-05-20 | 2016-09-07 | 德州学院 | Double-disc fault tolerant redundant array of independent disks capable of eliminating local parallel read-modify-write operation |
| CN106874141A (en) * | 2015-12-11 | 2017-06-20 | 中兴通讯股份有限公司 | A kind of fault-tolerance approach and IPTV system of data storage load |
Non-Patent Citations (1)
| Title |
|---|
| Ripple-RAID:一种面向连续数据存储的高效能盘阵;孙志卓等;《软件学报》;第1-16页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111782439A (en) | 2020-10-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111782439B (en) | Double-disk circulation verification method based on horizontal coding | |
| CN101587425B (en) | Method and device for increasing magnetic disc redundant array redundancy | |
| CN1097774C (en) | RAID level 5 with free blocks parity cache | |
| CN101916173B (en) | RAID (Redundant Array of Independent Disks) based data reading and writing method and system thereof | |
| US6647460B2 (en) | Storage device with I/O counter for partial data reallocation | |
| JPH04230512A (en) | Method and apparatus for updating record for dasd array | |
| CN101923441B (en) | Method for processing writing request of redundant array of hybrid magnetic disc, controller and storage system thereof | |
| KR20060052772A (en) | Data storage array | |
| CN103049222A (en) | RAID5 (redundant array of independent disk 5) write IO optimization processing method | |
| JP2004227560A (en) | Parity storage method and error block restoration method in external storage subsystem | |
| US7818524B2 (en) | Data migration systems and methods for independent storage device expansion and adaptation | |
| CN110442535B (en) | Method and system for improving reliability of distributed solid-state disk key value cache system | |
| CN101546249A (en) | On-line capacity expansion method for disk arrays | |
| CN111400083B (en) | Data storage method and system and storage medium | |
| CN101556802B (en) | RAID array transposing method and device thereof | |
| CN103870352A (en) | Method and system for data storage and reconstruction | |
| CN104182176A (en) | Rapid dilatation method for RAID 5 (redundant array of independent disks) | |
| US7133965B2 (en) | Raid storage device | |
| CN107678690A (en) | A kind of implementation method of solid state hard disc and its RAID array | |
| CN113296702B (en) | Disk array capacity expansion method, device, equipment and storage medium | |
| CN104484135A (en) | Method and device for quickly reading data | |
| CN107728943B (en) | Method for delaying generation of check optical disc and corresponding data recovery method | |
| CN110600070B (en) | Coding and repairing method for improving repairing performance of solid state disk array system | |
| US7971092B2 (en) | Methods and devices for high performance consistency check | |
| US20080104445A1 (en) | Raid array |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |