CN100388239C - Method and system for online increasing disk number for redundant array of inexpensive disks - Google Patents
Method and system for online increasing disk number for redundant array of inexpensive disks Download PDFInfo
- Publication number
- CN100388239C CN100388239C CNB2005100045380A CN200510004538A CN100388239C CN 100388239 C CN100388239 C CN 100388239C CN B2005100045380 A CNB2005100045380 A CN B2005100045380A CN 200510004538 A CN200510004538 A CN 200510004538A CN 100388239 C CN100388239 C CN 100388239C
- Authority
- CN
- China
- Prior art keywords
- disk
- redundant array
- subregion
- inexpensive
- data
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The present invention relates to a method and a system for the on-line increase of the number of magnetic diks of redundant arrays of inexpensive disks. The system comprises a zoning plan unit, a data transferring unit and a roll of reforming units, wherein the zoning plan unit is used for planing and expanding a plurality of sub zones on magnetic disks; the data transferring unit is responsible for transferring the data of sub zones of multiple pen original redundant arrays of inexpensive disks to target sub zones defined by the expanded magnetic disks; the reforming units are used for distributing the redundant arrays of inexpensive disks and the expanded disks according to the original data to recombining a plurality of sub zones in the roll. When a magnetic disk is expanded to the original redundant array of an inexpensive disk, data of a sub zone is transferred to the expanded magnetic disk from each original magnetic disk to achieve the purpose that under the condition of keeping the continuous running of the redundant arrays of inexpensive disks, the number of magnetic disks of the redundant arrays of inexpensive disks is increased simultaneously.
Description
Technical field
The present invention relates to a kind of Redundant Array of Inexpensive Disc system and method thereof, particularly do not stopping under the situation of Redundant Array of Inexpensive Disc running, shift to reach by partition data and expand system and the method thereof of a disk to Redundant Array of Inexpensive Disc.
Background technology
Be in the present information age, all files all store with the e-file form, have replaced to put down in writing with the form of paper originally, have not only avoided the waste of paper, have saved the space of depositing file more widely.The data in whole library only need several hard disks after electronization, can all store, but also so more highlight the importance of the normal operation of keeping disk.
Keep the security of storage and the integrality of data, avoid causing incalculable damage because of the fault of disk, in 1987, by Patterson, Gibson and these three people of Katz in UC Berkley, delivered the paper of " A Case of Redundant Array of Inexpensive Disks (Redundant Array of Inexpensive Disc scheme) " by name, its basic thought is exactly that less, the relatively inexpensive disk of a plurality of capacity is made up, make it in data security, and the big capacity hard disk that surpasses a costliness on the access usefulness.This designed concept is accepted soon, and since then, the technology of Redundant Array of Inexpensive Disc has obtained widespread use, and data storing has entered quicker, safer, the more cheap New Times.
Originally in design, Redundant Array of Inexpensive Disc is divided into grade 0 to 5, by each disk sector being divided into the subregion of block size unanimity, and get a subregion from different disks respectively and come out, be reassembled as a volume (volume), more all clove hitch are combined into a volume group (VG, Volume Group), its advantage is that script for the file that the capacity of single disk can't store, does not need the user to cut apart voluntarily, can deposit the volume group of being made up of a plurality of disk by the Redundant Array of Inexpensive Disc technology in.
In addition, one file is when access, originally can only in a disk, carry out, yet volume group (VG at Redundant Array of Inexpensive Disc, Volume Group) in, because a file all is to disperse simultaneously to deposit in each disk partition of a volume, the mode of parallel processing has increased the speed that stores greatly, and is as the same when reading.
The 3rd benefit is except that the Redundant Array of Inexpensive Disc of the 0th kind of kenel, the Redundant Array of Inexpensive Disc of other kenel all provides misarrangement mode in various degree, and when a disk breaks down, have the reducing power to stored data on the failed disk, this also makes the data keeping quality of Redundant Array of Inexpensive Disc greatly increase.Certainly, this need expend some disk spaces, but if with when disk breaks down, the data of being rescued are back compared with the value of the lasting normal operation of keeping system, and it is insignificant that the cost of this unnecessary disk just seems.
Though Redundant Array of Inexpensive Disc has so many advantages,, when a certain disk breaks down and can't retrieve, meaning and involve all files and all will damage because each file all is to be dispersed in each entity disk.Compare at single disk with the single document storage of tradition; the injury that Redundant Array of Inexpensive Disc is caused when disk breaks down is bigger; and because of the risk of the system failure is adding up of each disk failure risk, Data Protection and reduction in the time of therefore more need paying attention to the disk damage.
And, when newly-increased one expands disk, because the expansion disk can be merged with former Redundant Array of Inexpensive Disc, rebuliding volume and during the data mean allocation, causing losing of data especially easily during the course, comparatively insurance does the running that rule is a halt system, carry out the reorganization of volume Deng expanding disk and Redundant Array of Inexpensive Disc, and restart again after the mean allocation of data, this method obviously is worthless for the server that need keep open state always.
Summary of the invention
Fundamental purpose of the present invention is to provide a kind of online increase Redundant Array of Inexpensive Disc (RAID, Redundant Array of Inexpensive Disks) method and system of number of disks, under the situation of the running of halt system not, by each disk partition transferring data seriatim.
To achieve these goals, the present invention has announced a kind of system of online increase disk number for redundant array of inexpensive disks, and this system has:
One block planning unit expands a plurality of subregions on the disk in order to plan one;
One data transfer unit is in order to be responsible for that the partition data of many former Redundant Array of Inexpensive Discs is transferred to the target partition that this expansion disk is respectively divided out; And
One volume recomposition unit in order to this Redundant Array of Inexpensive Disc and this are expanded disk by former DATA DISTRIBUTION, reconfigures the partition conbination in a plurality of volumes.
The system of described online increase disk number for redundant array of inexpensive disks, respectively the space size of this subregion is all identical.
The system of described online increase disk number for redundant array of inexpensive disks, respectively this disk number of partitions of dividing equates with initial disk number in this Redundant Array of Inexpensive Disc.
The system of described online increase disk number for redundant array of inexpensive disks, newly-increased this expands disk can only single treatment one, treats that one adds after this Redundant Array of Inexpensive Disc finishes, and could increase second again newly, and the rest may be inferred.
The system of described online increase disk number for redundant array of inexpensive disks, this branch mode is after deleting this subregion earlier, expand in the subregion of disk in this again, utilize the fault-tolerant recovery mechanisms of Redundant Array of Inexpensive Disc disk system, calculate the partition data of other disk in the volume under these data, with the data of reducing on this deletion subregion.
The system of described online increase disk number for redundant array of inexpensive disks, this operational logic rule that shifts partition data is as follows:
When the original N of this Redundant Array of Inexpensive Disc disk, then on it respectively this disk be divided into N subregion, the data that n disk just shifts " subregion (N-n+1) n " expand on disk to this.
The system of described online increase disk number for redundant array of inexpensive disks, the subregion number of this transfer are N-1.
The system of described online increase disk number for redundant array of inexpensive disks, this Redundant Array of Inexpensive Disc of having adjusted has N+1 volume.
To achieve these goals, the present invention has also announced a kind of method of online increase disk number for redundant array of inexpensive disks, and the method includes the steps of:
Divide an expansion disk and become N subregion;
Each partition data that shifts in N-1 the disk expands N-1 subregion on disk to this;
A volume that belongs to originally by this partition data respectively adds N-1 subregion of this expansion disk in this volume; And
Will be because of the empty subregion that gets off behind the transferring data, and the subregion of this expansion disk one unallocated number certificate reassembles into a new volume.
The method of described online increase disk number for redundant array of inexpensive disks, respectively the space size of this subregion is all identical.
The method of described online increase disk number for redundant array of inexpensive disks, respectively this disk number of partitions of dividing equates with initial disk number in this Redundant Array of Inexpensive Disc.
The method of described online increase disk number for redundant array of inexpensive disks, newly-increased this expand disk can only single treatment one, treats that one is expanded disk and adds after this Redundant Array of Inexpensive Disc finishes, and could increase second expansion disk again, and the rest may be inferred.
The method of described online increase disk number for redundant array of inexpensive disks, this branch mode is after deleting this subregion earlier, expand in the subregion of disk in this again, utilize the fault-tolerant recovery mechanisms of Redundant Array of Inexpensive Disc disk system, calculate the partition data of other disk in the volume under these data, with the data of reducing on this deletion subregion.
The method of described online increase disk number for redundant array of inexpensive disks, this operational logic rule that shifts partition data is as follows:
When the original N of this Redundant Array of Inexpensive Disc disk, then on it respectively this disk be divided into N subregion, n disk just moved the data of " subregion (N-n+1) n " to this expansion disk.
The method of described online increase disk number for redundant array of inexpensive disks, this subregion number of moving are N-1.
The method of described online increase disk number for redundant array of inexpensive disks, this Redundant Array of Inexpensive Disc of having adjusted have N+1 volume.
In other words, the disclosed system of the present invention need comprise:
One block planning unit is in order to plan its subregion to expanding disk;
One data transfer unit is in order to be responsible for that the data of former Redundant Array of Inexpensive Disc are transferred to the subregion that the expansion disk is divided out; And
One volume recomposition unit in order to former Redundant Array of Inexpensive Disc and expansion disk are pressed former DATA DISTRIBUTION, reconfigures the partition conbination in the volume.
In addition, the method that the present invention carried comprises following steps:
At first, to expanding disk, divide subregion with each disk equal number according in the former Redundant Array of Inexpensive Disc;
By respectively shifting a partition data in N-1 the disk to a subregion that expands disk;
Volume by data belong to originally respectively adds this volume with N-1 the subregion that expands disk; And
At last, will be because of the empty subregion that gets off behind the transferring data, and the subregion that expands disk one unallocated number certificate reassembles into a new volume.
The invention has the beneficial effects as follows when expansion one disk arrives the Redundant Array of Inexpensive Disc of script, in each original disk, shift a partition data to the disk that expands, can under the lasting running of keeping Redundant Array of Inexpensive Disc, finish the disk number of amplification Redundant Array of Inexpensive Disc simultaneously.
About feature of the present invention and example, conjunction with figs. is described in detail as follows as most preferred embodiment:
Description of drawings
Fig. 1 is a system architecture synoptic diagram of the present invention;
Fig. 2 is a method flow diagram of the present invention;
Fig. 3 a is the synoptic diagram that the Redundant Array of Inexpensive Disc of three disks expands a disk;
Fig. 3 b is the synoptic diagram that shifts partition data;
Fig. 3 c is the formation synoptic diagram of new volume.
Wherein, description of reference numerals is as follows:
110-expands the former Redundant Array of Inexpensive Disc of disk 120-
130-block planning unit 140-data transfer unit
Redundant Array of Inexpensive Disc behind the 150-volume recomposition unit 160-transferring data
The volume that 170-is new
Step 210-divides the expansion disk and becomes N subregion
Each partition data in N-1 disk of step 220-transfer is to the N-1 that expands a disk subregion
The volume that step 230-belongs to originally by data respectively adds this volume with N-1 the subregion that expands disk
Step 240-will be because of the empty subregion that gets off behind the transferring data, and the subregion that expands disk one unallocated number certificate reassembles into a new volume
Embodiment
The present invention is a kind of online increase Redundant Array of Inexpensive Disc (RAID, Redundant Array ofInexpensive Disks) method and system of number of disks, though Redundant Array of Inexpensive Disc has multiple kenel, but can divide into the 0th kind, the 1st kind generally, and two kinds of combinations of deriving that merge and increase the misarrangement sign indicating number.If the 1st kind, just data in magnetic disk is made mirror back-up, then when increasing disk newly, need the disk of two expansions of carry simultaneously to get on, earlier the Redundant Array of Inexpensive Disc of first disk and the 1st kind of kenel of a copy of it is made the data mean allocation, this moment, system kept the lasting running of system with the Redundant Array of Inexpensive Disc of the 1st kind of kenel of another part, treat this data mean allocation finish errorless after, handle second newly-increased disk again, do the man-to-man corresponding modification of disk with the Redundant Array of Inexpensive Disc of finishing mean allocation respectively, so the present invention focuses on the newly-increased disk of the Redundant Array of Inexpensive Disc of the 1st kind of kenel.
For explanation can more easily be understood, so all explain with the specific embodiment of a newly-increased expansion disk 1 10 to former Redundant Array of Inexpensive Disc 120 with three disks.The main system architecture of the present invention sees also Fig. 1, and dotted line is a system construction drawing of the present invention partly, now is respectively described below:
Block planning unit 130 is in order to expansion disk 110 its subregions of planning that desire is added; If former Redundant Array of Inexpensive Disc 120 is made up of three disks, then wherein each disk number of blocks of dividing then is three.Shown in Fig. 3 a, the sector of disk 1 is divided Composition Region 11, subregion 21, is reached subregion 31, and the sector of disk 2 is divided Composition Region 12, subregion 22, reached subregion 32, and the sector of disk 3 is divided Composition Region 13, subregion 23, reached subregion 33; So it is also just the same with the partition size and the quantity of each disk in the former Redundant Array of Inexpensive Disc 120 to expand subregion division numbers and each subregion amount of capacity of disk 110, hence one can see that, the capacity of each disk all should be identical, if the amount of capacity of disk differs, then unified disk with the capacity minimum is that benchmark is done to cut apart, the disk of other larger capacity then will be wasted its unnecessary disk size and not use.
Data transfer unit 140 is in order to be responsible for that the data of depositing in former Redundant Array of Inexpensive Disc 120 subregions are transferred to the subregion that expansion disk 110 is divided out.And the mode that shifts, after then being the subregion deletion of earlier desire being shifted, cause Redundant Array of Inexpensive Disc (RAID) controller to think that disk partition makes a mistake, the illusion that data are lost on the subregion, and then the fault-tolerant recovery mechanisms of startup Redundant Array of Inexpensive Disc (RAID), the not deleted volume of utilization calculating is organized the data in other disk partition, and the partition data with deletion in the new subregion that expands disk 110 restores.
Shown in Fig. 3 b, because the partition size of each disk is all identical, so a subregion of each disk directly can be deleted, the 3rd disk just deleted 13, the 2 disks of subregion and just deleted subregion 22; After deletion finishes, then shown in Fig. 3 c, subregion 13 data of deletion are stored in the subregion 14 of sky of disk 4, utilize the fault-tolerant recovery mechanisms of Redundant Array of Inexpensive Disc (RAID), calculate not deleted volume and organize that subregion 11 and subregion 12 data restore on other disk.Similarly, also subregion 22 data with deletion are stored in the subregion 24 of sky of disk 4, utilize the fault-tolerant recovery mechanisms of Redundant Array of Inexpensive Disc (RAID), calculate not deleted volume and organize that subregion 21 and subregion 23 data restore on other disk.
Data transition rule of the present invention is, when former Redundant Array of Inexpensive Disc 120 had N disk, then each disk was divided into N subregion, and n disk just shifts the data of subregion (N-n+1) n to expanding on the disk 110.
Volume recomposition unit 150, in order to former Redundant Array of Inexpensive Disc 120 and expand disk 110 behind transferring data, distribution by volume under the former data reconfigures the partition conbination in the volume, becomes a new Redundant Array of Inexpensive Disc 160 and a new volume 170 behind the transferring data.
Shown in Fig. 3 c, after data transfer unit 140 was transferred to disk 4 with subregion 13 data, the subregion 14 that then stores subregion 13 data replaced the position of subregion 13, reformulated volume 1 with subregion 11 and subregion 12; In like manner, the subregion 24 that stores subregion 22 data in the disk 4 replaces the position of subregion 22, reformulates volume 2 with subregion 21 and subregion 23.
In addition, at because of behind the transferring data, disk the empty subregion that gets off, and the subregion that expands a unallocated number certificate on the disk reassembles into a new volume 170 with it.Shown in Fig. 3 c, when subregion 13 data of disk 3, and subregion 22 data of disk 2 are when forwarding disk 4 to, and this vacant partition space is promptly formed a new volume 170 with the space of a unallocated data partition 43 of disk 4.
Redundant Array of Inexpensive Disc after reorganization is finished except that 3 arrays of script, is added an array 170 of above-mentioned new composition, will roll up 1 at last to rolling up the 4 volume groups of forming after disks are expanded in an adding (VG, Volume Group).
Please refer to Fig. 2, this figure is a method flow diagram of the present invention.At first, to expanding disk 110 according to dividing subregion (step 210) with each disk equal number by block planning unit 130 in the former Redundant Array of Inexpensive Disc 120, wherein the space size of each subregion is all identical, and this number of partitions that expands division on the disk 110 is also the same with other disk.
Then, suppose that former Redundant Array of Inexpensive Disc 120 is made up of N disk, then by in 140 pairs of N-1 disks of data transfer unit, respectively move a partition data to a subregion (step 220) that expands disk, shown in Fig. 3 b, former Redundant Array of Inexpensive Disc 120 is made up of three disks, so we delete the subregion 13 of disk 3 and the subregion 22 of disk 2.
Utilize the fault-tolerant recovery mechanisms of Redundant Array of Inexpensive Disc (RAID), subregion 13 data of deletion are stored in the subregion 14 of sky of disk 4, calculate not deleted volume and organize that subregion 11 and subregion 12 data restore on other disk.Same, also subregion 22 data of deletion are stored in the subregion 24 of sky of disk 4, utilize the fault-tolerant recovery mechanisms of Redundant Array of Inexpensive Disc (RAID), calculate not deleted volume and organize that subregion 21 and subregion 23 data restore on other disk.
Then, the volume that belongs to originally by data, N-1 the subregion that expands disk respectively added in this volume (step 230), because the subregion 14 on the disk 4 is to deposit subregion 13 data, thus add the volume 1 that expands behind the disk, by subregion 11, subregion 12, and subregion 14 formed, in like manner, because the subregion 24 on the disk 4 is to deposit subregion 22 data, thus roll up 2 by subregion 21, subregion 23, and subregion 24 is formed, and then will roll up 1 to rolling up 3 Redundant Array of Inexpensive Discs of merging into behind the transferring data 160.
At last, will be because of the empty subregion that gets off behind the transferring data, and the subregion that expands a unallocated number certificate on the disk, be reassembled into a new volume (step 240).Shown in Fig. 3 c, after subregion 22 data shifted, because its volume that belongs to originally 2 existing subregions 24 are filled up, so it is enrolled in the newly-increased volume 4, promptly subregion 41.The same, behind subregion 13 data-movings, because its volume that belongs to originally 1 existing subregion 14 is filled up, so it is enrolled in the newly-increased volume 4, promptly subregion 42.Adding has still on the disk 4 that a subregion 43 is unallocated goes in arbitrary volume, so these three subregions are all enrolled in the volume 4.
The present invention once can only expand a disk.If will in the Redundant Array of Inexpensive Disc of kenel 1, increase plural disk newly,, after elder generation expands one, handle second with identical method more then by above-mentioned method.Therefore can under the running of halt system not, realize the purpose of online increase disk number for redundant array of inexpensive disks.
Though the present invention discloses as above by aforesaid preferred embodiment, be not in order to limit the present invention.Because any those skilled in the art without departing from the spirit and scope of the present invention, might do simple the change and retouching, therefore scope of patent protection of the present invention is as the criterion with this instructions appending claims.
Claims (16)
1. the system of an online increase disk number for redundant array of inexpensive disks is characterized in that this system has:
One block planning unit expands a plurality of subregions on the disk in order to plan one;
One data transfer unit is in order to be responsible for that the partition data of many former Redundant Array of Inexpensive Discs is transferred to the target partition that this expansion disk is respectively divided out; And
One volume recomposition unit in order to this Redundant Array of Inexpensive Disc and this are expanded disk by former DATA DISTRIBUTION, reconfigures the partition conbination in a plurality of volumes.
2. the system of online increase disk number for redundant array of inexpensive disks as claimed in claim 1 is characterized in that: respectively the space size of this subregion is all identical.
3. the system of online increase disk number for redundant array of inexpensive disks as claimed in claim 1 is characterized in that: respectively this disk number of partitions of dividing equates with initial disk number in this Redundant Array of Inexpensive Disc.
4. the system of online increase disk number for redundant array of inexpensive disks as claimed in claim 1, it is characterized in that: newly-increased this expansion disk can only single treatment one, after treating that this Redundant Array of Inexpensive Disc of adding is finished, could increase second again newly, the rest may be inferred.
5. the system of online increase disk number for redundant array of inexpensive disks as claimed in claim 1, it is characterized in that: this branch mode is after deleting this subregion earlier, expand in the subregion of disk in this again, utilize the fault-tolerant recovery mechanisms of Redundant Array of Inexpensive Disc disk system, calculate the partition data of other disk in the volume under these data, with the data of reducing on this deletion subregion.
6. the system of online increase disk number for redundant array of inexpensive disks as claimed in claim 1 is characterized in that: the operational logic rule of this transfer partition data is as follows:
When the original N of this Redundant Array of Inexpensive Disc disk, then on it respectively this disk be divided into N subregion, the data that n disk just shifts " subregion (N-n+1) n " expand on disk to this.
7. the system of online increase disk number for redundant array of inexpensive disks as claimed in claim 6 is characterized in that: the subregion number of this transfer is N-1.
8. the system of online increase disk number for redundant array of inexpensive disks as claimed in claim 6 is characterized in that: this Redundant Array of Inexpensive Disc of having adjusted has N+1 volume.
9. the method for an online increase disk number for redundant array of inexpensive disks is characterized in that the method includes the steps of:
Divide an expansion disk and become N subregion;
Each partition data that shifts in N-1 the disk expands N-1 subregion on disk to this;
A volume that belongs to originally by this partition data respectively adds N-1 subregion of this expansion disk in this volume; And
Will be because of the empty subregion that gets off behind the transferring data, and the subregion of this expansion disk one unallocated number certificate reassembles into a new volume.
10. the method for online increase disk number for redundant array of inexpensive disks as claimed in claim 9 is characterized in that: respectively the space size of this subregion is all identical.
11. the method for online increase disk number for redundant array of inexpensive disks as claimed in claim 9 is characterized in that: respectively this disk number of partitions of dividing equates with initial disk number in this Redundant Array of Inexpensive Disc.
12. the method for online increase disk number for redundant array of inexpensive disks as claimed in claim 9, it is characterized in that: newly-increased this expansion disk can only single treatment one, treat that one is expanded disk and adds after this Redundant Array of Inexpensive Disc finishes, could increase second again newly and expand disk, the rest may be inferred.
13. the method for online increase disk number for redundant array of inexpensive disks as claimed in claim 9, it is characterized in that: this branch mode is after deleting this subregion earlier, expand in the subregion of disk in this again, utilize the fault-tolerant recovery mechanisms of Redundant Array of Inexpensive Disc disk system, calculate the partition data of other disk in the volume under these data, with the data of reducing on this deletion subregion.
14. the method for online increase disk number for redundant array of inexpensive disks as claimed in claim 9 is characterized in that: the operational logic rule of this transfer partition data is as follows:
When the original N of this Redundant Array of Inexpensive Disc disk, then on it respectively this disk be divided into N subregion, the data that n disk just shifts " subregion (N-n+1) n " expand on disk to this.
15. the method for online increase disk number for redundant array of inexpensive disks as claimed in claim 14 is characterized in that: the subregion number of this transfer is N-1.
16. the method for online increase disk number for redundant array of inexpensive disks as claimed in claim 9 is characterized in that: this Redundant Array of Inexpensive Disc of having adjusted has N+1 volume.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100045380A CN100388239C (en) | 2005-01-18 | 2005-01-18 | Method and system for online increasing disk number for redundant array of inexpensive disks |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100045380A CN100388239C (en) | 2005-01-18 | 2005-01-18 | Method and system for online increasing disk number for redundant array of inexpensive disks |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1808398A CN1808398A (en) | 2006-07-26 |
| CN100388239C true CN100388239C (en) | 2008-05-14 |
Family
ID=36840307
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100045380A Expired - Fee Related CN100388239C (en) | 2005-01-18 | 2005-01-18 | Method and system for online increasing disk number for redundant array of inexpensive disks |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100388239C (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106933515A (en) * | 2017-03-15 | 2017-07-07 | 郑州云海信息技术有限公司 | A kind of disk RAID redundancy approach for taking into account read or write speed and data safety |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1247608A (en) * | 1997-02-27 | 2000-03-15 | 国际商业机器公司 | Transformational raid for hierarchical storage management system |
| US6321345B1 (en) * | 1999-03-01 | 2001-11-20 | Seachange Systems, Inc. | Slow response in redundant arrays of inexpensive disks |
| CN1542600A (en) * | 2003-04-26 | 2004-11-03 | �Ҵ���˾ | Configuring memory for a raid storage system |
-
2005
- 2005-01-18 CN CNB2005100045380A patent/CN100388239C/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1247608A (en) * | 1997-02-27 | 2000-03-15 | 国际商业机器公司 | Transformational raid for hierarchical storage management system |
| US6321345B1 (en) * | 1999-03-01 | 2001-11-20 | Seachange Systems, Inc. | Slow response in redundant arrays of inexpensive disks |
| CN1542600A (en) * | 2003-04-26 | 2004-11-03 | �Ҵ���˾ | Configuring memory for a raid storage system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1808398A (en) | 2006-07-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102024016B (en) | Rapid data restoration method for distributed file system (DFS) | |
| CN100565530C (en) | A kind of fast photographic system and using method thereof | |
| CN101814044B (en) | Method and device for processing metadata | |
| CN101276302B (en) | Magnetic disc fault processing and data restructuring method in magnetic disc array system | |
| CN101008918B (en) | Storage system and data restoration method thereof | |
| CN102511036B (en) | Data store | |
| CN104503706B (en) | A kind of data storage and read method based on disk array | |
| CN101587425B (en) | Method and device for increasing magnetic disc redundant array redundancy | |
| CN102004769B (en) | File management method, equipment and memory system | |
| CN101923501B (en) | Disk array multi-level fault tolerance method | |
| CN102201005A (en) | Method for distributing streaming media enhanced file of file system | |
| CN107357680A (en) | Data processing equipment and the method for data processing | |
| CN102855294A (en) | Intelligent hash data layout method, cluster storage system and method thereof | |
| CN103051691B (en) | Partition allocation method, device and distributed memory system | |
| GB2418769A (en) | Storing data across a plurality of disks | |
| CN105787037B (en) | A kind of delet method and device of repeated data | |
| JP2000099282A (en) | File management system | |
| CN102622185A (en) | Method for storing document in plurality of storage units and storage allocation method | |
| CN102150137A (en) | System and method for loose coupling between RAID volumes and drive groups | |
| CN104778018A (en) | Broad-strip disk array based on asymmetric hybrid type disk image and storage method of broad-strip disk array | |
| CN100367181C (en) | Hard disk re-recognition system and method in redundancy array of inexpensive disks | |
| CN102226892B (en) | Disk fault tolerance processing method and device thereof | |
| CN101984400A (en) | RAID control method, device and system | |
| CN106569751A (en) | Multi-controller cache mirroring method and system | |
| CN102591746A (en) | Data reconstruction method and storage equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080514 Termination date: 20110118 |