Patent US5517632A successfully refreshed from Google Patents.
US5517632A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Redundant array of disks with improved storage and recovery speed
Assignee: Mitsubishi Electric Corp
•
Filing: 1993-08-23
•
Granted: 1996-05-14
•
Expires: 2013-08-23
Abstract
Abstract In a redundant array of disks, the disks are divided into areas of different sizes, so that small amounts of data can be stored in an area of an appropriate size on a single disk, instead of being spread over multiple disks. A usage status table indicates which areas are in use. Check information is generated and stored only for areas indicated to be in use. When new check information is generated, it is therefore possible to omit the reading of unnecessary old data and old check information.
Inventors
- 👤 Toshio Matsumoto
- 👤 Hiroshi Baba
- 👤 Kazuhiko Itoh
- 👤 Shiro Ogura
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 14:13
CPC Classifications
G; G11; G11B; G11B20/00; G11B20/10; G11B20/18; G11B20/1816; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1076; G06F11/108; G06F11/30; G06F11/3003; G06F11/3034; G06F11/3055; G06F3/00; G06F3/06; G06F3/0601; G06F3/0602; G06F3/061; G06F3/0611; G06F3/0613; G06F3/0628; G06F3/0638; G06F3/0644; G06F3/0646; G06F3/065; G06F3/0668; G06F3/0671; G06F3/0683; G06F3/0689; G11B20/12; G11B20/1217; G11B20/1252; G11B20/1803; G11B20/1833; G11B20/1883; G11B27/00; G11B27/002; G11B27/10; G11B27/11; G11B27/19; G11B27/28; G11B27/32; G11B27/327; G11B27/329; G06F11/14; G06F11/1446; G06F11/1458; G06F11/1461; G06F11/16; G06F11/20; G06F11/2053; G06F11/2056; G06F2211/00; G06F2211/10; G06F2211/1002; G06F2211/1019; G06F2211/1033; G06F2211/1054; G11B2220/00; G11B2220/20; G11B2220/40; G11B2220/41; G11B2220/415; G11B2220/60; G11B2220/65
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
125 words
A method of storing data in a redundant array of disks, comprising the steps of: partitioning said redundant array of disks into a plurality of areas, each area being a portion of one disk of the redundant array of disks, wherein each area has a size which is one of at least two different sizes; receiving a command to store a quantity of data in said redundant array; selecting at least one area of the plurality of areas so that a sum of the size of the selected at least one area is adequate to store said quantity of data, and the number of the selected at least one area is minimized; and storing said quantity of data in the selected at least one area.
Claim 2
Independent Claim
125 words
A method of storing data in a redundant array of disks, comprising the steps of: partitioning said redundant array of disks into a plurality of areas, each area being a portion of one disk of the redundant array of disks, wherein each area has a size which is one of at least two different sizes; receiving a command to store a quantity of data in said redundant array; selecting at least one area of the plurality of areas so that a sum of the size of the selected at least one area is adequate to store said quantity of data, and the number of the selected at least one area is minimized; and storing said quantity of data in the selected at least one area.
Claim 3
Dependent Claim
22 words
The method of claim 1, wherein, for each disk, areas having an identical size are disposed in contiguous locations on said disk.
Claim 4
Dependent Claim
25 words
The method of claim 1, wherein, for each disk, areas having an identical size are disposed in at least partly non-contiguous locations on said disk.
Claim 5
Dependent Claim
25 words
The method of claim 1, further comprising the step of providing, in a semiconductor memory, an area table having pointers to the plurality of areas.
Claim 6
Dependent Claim
23 words
The method of claim 1, wherein the step of partitioning is carried out prior to the step of storing said quantity of data.
Claim 7
Dependent Claim
62 words
The method of claim 1, wherein the step of partitioning said redundant array of disks into the plurality of areas includes the steps of: initially partitioning the redundant array of disks into a plurality of blocks having uniform sizes; and combining selected contiguous blocks to form each of the plurality of areas as commands to store different quantities of data are received.
Claim 8
Dependent Claim
82 words
The method of claim 1, wherein said redundant array of disks has a group of disks and wherein the step of partitioning said redundant array includes: partitioning each disk in the group of disks identically to form a plurality of groups of areas, each group of areas having one corresponding area on each disk in the group of disks; and designating one area in each of said groups of areas for storing check information for other areas in the group of areas.
Claim 9
Dependent Claim
24 words
The method of claim 7, wherein all areas designated for storing check information are disposed on a single disk in said group of disks.
Claim 10
Dependent Claim
22 words
The method of claim 7, wherein areas designated for storing check information are distributed over all disks in said group of disks.
Claim 11
Dependent Claim
65 words
The method of claim 1, wherein the redundant array of disks includes a first disk, wherein the step of selecting the at least one area includes selecting a first area on the first disk, and wherein the step of storing said quantity of data in the selected at least one area includes storing said quantity of data on the first area on the first disk.
Claim 12
Dependent Claim
152 words
A redundant array of disks, comprising: a plurality of disks for storing data, partitioned into a plurality of areas, each area being a portion of one disk of the redundant array of disks, wherein each area has a size which is one of at least two different sizes; a first semiconductor memory for storing new data received from a host computer; a second semiconductor memory for storing an area table having a plurality of pointers corresponding to areas of different sizes, among said plurality of areas; and a microprocessor to refer to said area table to select at least one area of the plurality of areas so that a sum of the size of the selected at least one area is adequate to store said new data, and the number of the selected at least one area is minimized, and to write said new data on the selected at least one area.
Claim 13
Dependent Claim
152 words
A redundant array of disks, comprising: a plurality of disks for storing data, partitioned into a plurality of areas, each area being a portion of one disk of the redundant array of disks, wherein each area has a size which is one of at least two different sizes; a first semiconductor memory for storing new data received from a host computer; a second semiconductor memory for storing an area table having a plurality of pointers corresponding to areas of different sizes, among said plurality of areas; and a microprocessor to refer to said area table to select at least one area of the plurality of areas so that a sum of the size of the selected at least one area is adequate to store said new data, and the number of the selected at least one area is minimized, and to write said new data on the selected at least one area.
Claim 14
Dependent Claim
22 words
The array of claim 11, wherein, for each disk, areas having an identical size are disposed in contiguous locations on said disk.
Claim 15
Dependent Claim
25 words
The array of claim 11, wherein, for each disk, areas having an identical size are disposed at least partly in non-contiguous locations on said disk.
Claim 16
Dependent Claim
27 words
The array of claim 11, wherein each disk is partitioned into blocks of uniform size, and said microprocessor combines contiguous blocks to form the plurality of areas.
Claim 17
Dependent Claim
73 words
The array of claim 11, wherein said array has a group of disks such that: each disk is partitioned in the group of disks identically to form a plurality of groups of areas, each group of areas having one corresponding area on each disk in the group of disks; and one area is designated in each of said groups of areas for storing check information for other areas in the group of areas.
Claim 18
Dependent Claim
24 words
The array of claim 15, wherein all areas designated for storing check information are disposed on a single disk in said group of disks.
Claim 19
Dependent Claim
22 words
The array of claim 15, wherein areas designated for storing check information are distributed over all disks in said group of disks.
Claim 20
Dependent Claim
48 words
The array of claim 11, wherein the plurality of disks includes a first disk, wherein the plurality of areas includes a first area on the first disk, and wherein the microprocessor includes circuitry to select the first area, and to write said new data on the first area.
References Cited (Backward Citations)
US4761785B1
Cited
US4761785A
Cited
US4903234A
Cited
US4864572A
Cited
US4993030A
Cited
EP0369707A2
Cited
US5058003A
Cited
EP0481759A2
Cited
EP0485110A2
Cited
EP0493984A2
Cited
US5257362A
Cited
WO1993013475A1
Cited
US5408644A
Cited
US5392244A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-05-14 | 1999-11-13 | 2000-05-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-05-14 | 2003-11-13 | 2004-05-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-05-14 | 2007-11-13 | 2008-05-14 | $7700.00 | Window Closed / Lapsed |