EP0726514A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Methods for using non contiguously reserved storage space for data migration in a redundant hierarchic data storage system
Assignee: HP Inc
•
Filing: 1995-08-08
•
Granted: —
•
Expires: 2015-08-08
Abstract
Abstract A hierarchic disk array data storage system (10) has multiple storage disks (12) that define a physical storage space (34) and a RAID management system (16) that maps the physical storage space (34) into two virtual storage spaces. A RAID-level virtual storage space (40) presents the physical storage space as mirror and parity RAID areas where the mirror RAID areas store data according to RAID Level 1 and the parity RAID areas store data according to RAID Level 5. An application-level virtual storage space (50) presents the physical storage space as multiple virtual blocks. The RAID management system (16) migrates data between the mirror and parity RAID areas to optimize performance and reliability. To facilitate migration, the RAID management system (16) guarantees a minimum of unused storage space that can be used to empty a RAID area for the purpose of converting the RAID level or other storage attribute of the RAID area. The minimum unused storage space is preferably equivalent in size to at least one largest parity RAID area. However, the unused storage space is not in any one physical location, but can be allowed to distribute itself over various RAID areas in a non-contiguous manner across the storage disks.
Inventors
- 👤 Theresa A. Burkes
- 👤 Bryan M. Diamond
- 👤 Michael B. Jacobson
- 👤 Marvin D. Nelson
- 👤 Douglas L. Voigt
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-01 14:01
CPC Classifications
G; G11; G11C; G11C29/00; G11C29/70; G11C29/74; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1076; G06F3/00; G06F3/06; G06F3/0601; G06F3/0602; G06F3/061; G06F3/0614; G06F3/0628; G06F3/0646; G06F3/0647; G06F3/0668; G06F3/0671; G06F3/0683; G06F3/0689; G11B; G11B20/00; G11B20/10; G11B20/18; G11B20/1803; G06F3/0673
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
197 words
A method for using a reserved amount of unused storage space in a hierarchic data storage system (10); the data storage system comprising multiple storage disks (12) that define a physical storage space (34); the method comprising the following steps: mapping the physical storage space (34) into a RAID-level virtual storage space (40) having multiple first and second RAID areas, the first RAID areas having first allocation blocks which store data according to a first RAID level and the second RAID areas having second allocation blocks which store data according to a second RAID level; providing a reserved amount of unused storage space within the RAID-level virtual storage space (40); mapping the RAID-level virtual storage space (40) into an application-level virtual storage space (50) having multiple virtual blocks; migrating data from a first used allocation block to a second used allocation block so that the data once stored according to one of the first or second RAID levels is now stored according to the other of the first or second RAID levels, whereby following said migrating, the second allocation block is used and the first allocation block becomes unused, thereby conserving the amount of unused storage space.
Claim 2
Dependent Claim
53 words
A method according to claim 1 further comprising: providing N storage disks in the data storage system (10); and providing a reserved amount of unused storage space that is equivalent to at least a number of virtual blocks that can be stored in a largest possible RAID area of a multiple of N-1.
Claim 3
Independent Claim
264 words
A method for using reserved storage space in a hierarchic data storage system (10); the data storage system comprising multiple storage disks (12) that define a physical storage space (34); the method comprising the following steps: mapping the physical storage space (40) into a RAID-level virtual storage space (40) having mirror, parity, and unused RAID areas; the mirror RAID areas having mirror allocation blocks which store data according to mirror redundancy, the parity RAID areas having parity allocation blocks which store data according to parity redundancy, and the unused RAID areas containing no data; providing a minimum reserved amount of unused storage space within the RAID-level virtual storage space (40) that can be allowed to distribute across the storage disks; mapping the RAID-level virtual storage space (40) into an application-level virtual storage space (50) having multiple virtual blocks; attempting to locate a usable mirror allocation block; in the event that a usable mirror allocation block is located, writing data to the mirror allocation block; and in the event that no usable mirror allocation block is located, creating a usable mirror allocation block to receive the data by conducting at least one of the following additional steps: (1) locating an unused RAID area and converting it to a mirror RAID area containing a usable mirror allocation block; (2) gathering empty mirror allocation blocks or empty parity allocation blocks into an unused RAID area that may be used to create a mirror RAID area; and (3) migrating data from mirror allocation blocks to parity allocation blocks and gathering unused mirror allocation blocks into unused RAID areas.
Claim 4
Dependent Claim
179 words
A method according to claim 3 wherein the step of creating a usable mirror allocation block comprises the following steps in sequential order until a usable mirror allocation block is created: (1) locating an unused RAID area and converting it to a mirror RAID area containing a usable mirror allocation block; (2) gathering empty parity allocation blocks into an unused RAID area and converting the unused RAID area to a mirror RAID area containing a usable mirror allocation block; and (3) alternately performing the following steps (a) and (b) until an unused RAID area is created, then performing step (c): (a) migrating data from a mirror allocation block to a parity allocation block to empty the mirror allocation block; (b) gathering the empty mirror allocation block into an unused RAID area; and (c) following said steps (3)(a) and (3)(b), converting the unused RAID area into a parity RAID area; repeating said steps (3)(a)-(3)(c) until an unused RAID area is created that can be converted into a mirror RAID area without violating the minimum reserved amount of unused storage space.
Claim 5
Independent Claim
208 words
A method for using a reserved amount of unused reserved storage space in a hierarchic data storage system (10); the data storage system comprising multiple storage disks (12) that define a physical storage space (34); the method comprising the following steps: mapping the physical storage space (34) into a RAID-level virtual storage space (40) having multiple first and second RAID areas, the first RAID areas having first allocation blocks which store data according to a first RAID level and the second RAID areas having second allocation blocks which store data according to a second RAID level; providing a minimum number of unused allocation blocks within the RAID-level virtual storage space (40) that can be distributed across the storage disks; mapping the RAID-level virtual storage space (40) into an application-level virtual storage space (50) having multiple virtual blocks; migrating data between the first and second allocation blocks so that the data once stored according to one of the first or second RAID levels is now stored according to the other of the first or second RAID levels; locating a first or second RAID area that is partially filled with data; and emptying the located RAID area by moving the data from the located RAID area to unused allocation blocks.
Claim 6
Dependent Claim
53 words
A method according to claim 5 further comprising: providing N storage disks in the data storage system (10); and providing a reserved amount of unused storage space that is equivalent to at least a number of virtual blocks that can be stored in a largest possible RAID area of a multiple of N-1.
Claim 7
Dependent Claim
27 words
A method according to claim 5 wherein the locating step comprises locating a first or second RAID area that contains the least amount of data stored therein.
Claim 8
Dependent Claim
24 words
A method according to claim 5 further comprising the additional step of rewriting data from a whole RAID area to the emptied RAID area.
Claim 9
Dependent Claim
26 words
A method according to claim 5 further comprising the additional step of converting the emptied RAID area to one of a mirror or parity RAID area.
Claim 10
Dependent Claim
73 words
A method according to claim 5 wherein: the step of providing a minimum number of unused allocation blocks comprises providing unused allocation blocks in both the first and second RAID areas; and the step of emptying a located RAID area comprises moving data from the located RAID area to unused allocation blocks in both the first RAID areas of the first RAID level and the second RAID areas of the second RAID level.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.