← Back to Patent Explorer
US5337322A Expired / Lapsed US ⏱️ 0.0 years remaining

Method of processing stored data containing parity data

Assignee: Wistron Corp
•
Filing: 1992-03-02
•
Granted: 1994-08-09
•
Expires: 2012-03-02
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for efficiently storing data into a data storage system containing parity data comprises the steps of: determining the data storage units and the portions of each data storage unit where the data will be stored; determining the number of times the data units are accessed to calculate parity data for the new data, to store the new data, and to store the parity data using the complementary mode; determining the number of times the data units are accessed to calculate parity data for the new data, to store the new data, and to store the parity data using the noncomplementary mode; comparing the number times the data units are accessed using the complementary mode to the number of times the data units are accessed using the noncomplementary mode; calculating the parity data with the mode that requires the fewest number of accesses; and storing the calculated parity data and the new data in the data storage units. Thereby, the present invention minimizes the number of times the disk must be accessed to calculate parity.

Inventors

  • 👤 Yun-Huei Wang
  • 👤 Chung-Hua Wu

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-05 21:00
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1076; G06F11/1008; G11; G11B; G11B20/00; G11B20/10; G11B20/18; G11B20/1833

Claims Analysis

Total Claims: 11
Claim 1
Independent Claim 179 words
A method for using new data to calculate parity data, and for storing new data and the parity data into a data storage system, said data storage system comprising a plurality of data storage units each capable of storing data, said method comprising the steps of: (a) determining the data storage units and the portions of each data storage unit where the data will be stored; (b) determining the number of times the data units are accessed to calculate parity data for the new data, to store the new data, and to store the parity data using a complementary mode; (c) determining the number of times the data units are accessed to calculate parity data for the new data, to store the new data, and to store the parity data using a noncomplementary mode; (d) comparing the number of times the data units are accessed in said complementary mode to the number of times the data units are accessed in said noncomplementary mode; and (e) calculating the parity data with the mode that requires the fewest number of accesses.
Claim 2
Independent Claim 179 words
A method for using new data to calculate parity data, and for storing new data and the parity data into a data storage system, said data storage system comprising a plurality of data storage units each capable of storing data, said method comprising the steps of: (a) determining the data storage units and the portions of each data storage unit where the data will be stored; (b) determining the number of times the data units are accessed to calculate parity data for the new data, to store the new data, and to store the parity data using a complementary mode; (c) determining the number of times the data units are accessed to calculate parity data for the new data, to store the new data, and to store the parity data using a noncomplementary mode; (d) comparing the number of times the data units are accessed in said complementary mode to the number of times the data units are accessed in said noncomplementary mode; and (e) calculating the parity data with the mode that requires the fewest number of accesses.
Claim 3
Dependent Claim 32 words
The method of claim 1, further comprising the steps of: (f) storing the calculated parity data in the data storage units; and (g) storing the new data in the data storage units.
Claim 4
Dependent Claim 92 words
The method of claim 1, wherein the data storage system further comprises a host central processing unit (CPU), a decoding control unit, and the method further comprises the steps of: (1) determining whether the host CPU has requested access to the data storage units; (2) decoding a request from the host CPU to determine whether it is a read or a write operation; (3) if the request is a read operation, then, processing the request without performing steps a-e; and (4) if the request is a write operation proceeding to step (a).
Claim 5
Dependent Claim 29 words
The method of claim 3, wherein said step of determining whether the host CPU has requested access to the data storage units is performed by the decoding control unit.
Claim 6
Dependent Claim 53 words
The method of claim 1, wherein the data storage units are disk drives having data sectors, and step (a) determines the data sectors on each disk drive that are allocated for the storage of the new data and the data sectors on each disk drive that are needed to calculate the parity data.
Claim 7
Dependent Claim 65 words
The method of claim 1, wherein the data storage units are disk drives having data sectors, and wherein step (b) determines the number of times the data units are accessed in the complementary mode using the equation: Tc=Y+Z+1 where "Y" indicates the number of data sectors that will contain new data, and "Z" indicates the number of data sectors that will not contain new data.
Claim 8
Dependent Claim 58 words
The method of claim 1, wherein the data storage units are disk drives having data sectors, and wherein step (c) determines the number of times the data units are accessed in the noncomplementary mode using the equation: T.sub.N =Y×2+2 where "Y" indicates the number of data sectors that will have to be accessed to store the new data.
Claim 9
Dependent Claim 24 words
The method of claim 1, wherein one of said data storage units is reserved for storing parity data corresonding the other data storage units.
Claim 10
Dependent Claim 53 words
The method of claim 1 wherein each of said plurality of data storage units is used for storing data, and wherein said parity data is distributed across all of said plurality of data storage units so that said parity data is not stored in two consecutive sectors of the same data storage unit.
Claim 11
Dependent Claim 22 words
The method of claim 1 wherein said plurality of data storage units is a plurality of magnetic disks in a RAID system.

References Cited (Backward Citations)

US5208813A Cited
US5191584A Cited
US5257362A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1997-08-08 1998-02-07 1998-08-09 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2001-08-08 2002-02-07 2002-08-09 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2005-08-08 2006-02-07 2006-08-09 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag