Patent US5737745A successfully refreshed from Google Patents.
US5737745A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Redundant array of disks with host notification process for improved storage and recovery speed
Assignee: Mitsubishi Electric Corp
•
Filing: 1996-01-04
•
Granted: 1998-04-07
•
Expires: 2016-01-04
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. When a disk fails and is replaced with a standby disk, only the data in areas indicated to be in use are reconstructed. Check information can be stored on a solid-state disk.
Inventors
- 👤 Toshio Matsumoto
- 👤 Hiroshi Baba
- 👤 Kazuhiko Itoh
- 👤 Shiro Ogura
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 14:03
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: 13
Claim 1
Independent Claim
138 words
A method of storing new data in a redundant array of disks, comprising the steps of: receiving said new data from a host computer; storing said new data in a semiconductor memory; selecting an area on at least one disk in said redundant array in which to store said new data; writing said new data on the area on said disk in said redundant array; notifying said host computer that said new data is written on said disk in said redundant array as soon as the foregoing step of writing the new data ends; reading data from another area on at least one other disk in said redundant array; computing check information from the new data stored in said semiconductor memory and the data thus read; and writing said check information on a disk in said redundant array.
Claim 2
Independent Claim
138 words
A method of storing new data in a redundant array of disks, comprising the steps of: receiving said new data from a host computer; storing said new data in a semiconductor memory; selecting an area on at least one disk in said redundant array in which to store said new data; writing said new data on the area on said disk in said redundant array; notifying said host computer that said new data is written on said disk in said redundant array as soon as the foregoing step of writing the new data ends; reading data from another area on at least one other disk in said redundant array; computing check information from the new data stored in said semiconductor memory and the data thus read; and writing said check information on a disk in said redundant array.
Claim 3
Dependent Claim
41 words
The method of claim 1, wherein the steps of reading data from another area, computing check information, and writing said check information are omitted if more new data to be stored are received from said host computer within a certain time.
Claim 4
Dependent Claim
89 words
The method of claim 1, wherein: the steps described in claim 1 are carried out by a processor that executes foreground tasks and background tasks, said foreground tasks having higher priority than said background tasks; the steps of storing said new data in said semiconductor memory, selecting areas, writing said new data on said areas, and notifying said host computer are performed as foreground tasks; and the steps of reading data from another area, computing new check information, and writing said new check information are performed as background tasks.
Claim 5
Dependent Claim
23 words
The method of claim 1, wherein the step of writing said check information is performed after the step of writing said new data.
Claim 6
Dependent Claim
20 words
The method of claim 1, wherein the step of writing said check information is performed after the step of notifying.
Claim 7
Independent Claim
108 words
A method of storing new data in a redundant group of disks, comprising the steps of: receiving said new data from a host computer; writing said new data on at least one disk in said redundant group of disks; notifying said host computer that said new data is written on said disk in said redundant group of disks as soon as the foregoing step of writing the new data ends; and reading data from disks in said redundant group of disks at periodic intervals, computing check information from the data thus read, and writing said check information on at least one disk in said redundant group of disks.
Claim 8
Independent Claim
108 words
A method of storing new data in a redundant group of disks, comprising the steps of: receiving said new data from a host computer; writing said new data on at least one disk in said redundant group of disks; notifying said host computer that said new data is written on said disk in said redundant group of disks as soon as the foregoing step of writing the new data ends; and reading data from disks in said redundant group of disks at periodic intervals, computing check information from the data thus read, and writing said check information on at least one disk in said redundant group of disks.
Claim 9
Dependent Claim
18 words
The method of claim 6, wherein said periodic intervals are adjustable in length according to desired data reliability.
Claim 10
Dependent Claim
33 words
The method of claim 6 wherein, in the step of reading data, computing check information, and writing said check information at periodic intervals, all data stored in said group of disks are read.
Claim 11
Dependent Claim
52 words
The method of claim 6, comprising the further step of memorizing areas in which data have been updated, wherein: in the reading of data, computing of check information, and writing of said check information at an end of a periodic interval, only data that have been updated during that interval are read.
Claim 12
Dependent Claim
39 words
The method of claim 6, wherein the step of reading, computing and writing includes a step of writing check information corresponding to said new data to said redundant group of disks after the step of writing said new data.
Claim 13
Dependent Claim
36 words
The method of claim 6, wherein the step of reading, computing and writing includes a step of writing check information corresponding to said new data to said redundant group of disks after the step of notifying.
References Cited (Backward Citations)
US5402428A
Cited
US5274799A
Cited
US5442752A
Cited
US5418921A
Cited
US5426761A
Cited
US5499354A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-04-06 | 2001-10-06 | 2002-04-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-04-06 | 2005-10-06 | 2006-04-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-04-06 | 2009-10-06 | 2010-04-07 | $7700.00 | Window Closed / Lapsed |