Patent US5359611A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5359611A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for reducing partial write latency in redundant disk arrays

Assignee: Dell USA LP
•
Filing: 1990-12-14
•
Granted: 1994-10-25
•
Expires: 2010-12-14
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An apparatus and method for a computer system having at least three disk drives in a storage array in which the rotational speed and angular position of the disk spindles are synchronized. At least two of these disks store data and at least one disk stores parity. All disks have corresponding tracks and sectors, however, the corresponding sectors of the parity disk are skewed in angular position so as to allow adequate time for the disk controller to read existing data from data disk sectors, calculate parity for new data to be written, and write the calculated parity to the corresponding sectors of the parity disk all during the same revolution of the disks.

Inventors

  • 👤 Terry J. Parks
  • 👤 E. Alan Davis
  • 👤 Geoffrey B. Hoese

Bibliographic Details

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

Claims Analysis

Total Claims: 9
Claim 1
Independent Claim 231 words
In a computer system including a processor, random access memory and a data storage system having multiple disks rotated by disk spindles in which rotational speed and angular position of said disk spindles are synchronized, said data storage system comprising: at least three disk drives, each of said disk drives having corresponding tracks and sectors for storing digital data within said sectors; control means for writing digital data to and reading digital data from said tracks and sectors of said disk drives, said control means connected to said disk drives; wherein at least one of said disk drives is used to store parity data, and the other of said disk drives is used to store general data, said parity data calculated from the general data stored on said corresponding sectors of said disk drives containing said general data; and wherein said sectors containing said parity data being position skewed in relation to said corresponding sectors of said disk drives containing said general data so that said control means may read or write said general data across corresponding data stripes and calculate parity for said corresponding data stripes of said disk drives containing said general data before writing the calculated parity onto corresponding sectors of said disk drives containing parity data and before said disk drives containing said parity data have completed a full revolution after reading or writing said general data.
Claim 2
Dependent Claim 231 words
In a computer system including a processor, random access memory and a data storage system having multiple disks rotated by disk spindles in which rotational speed and angular position of said disk spindles are synchronized, said data storage system comprising: at least three disk drives, each of said disk drives having corresponding tracks and sectors for storing digital data within said sectors; control means for writing digital data to and reading digital data from said tracks and sectors of said disk drives, said control means connected to said disk drives; wherein at least one of said disk drives is used to store parity data, and the other of said disk drives is used to store general data, said parity data calculated from the general data stored on said corresponding sectors of said disk drives containing said general data; and wherein said sectors containing said parity data being position skewed in relation to said corresponding sectors of said disk drives containing said general data so that said control means may read or write said general data across corresponding data stripes and calculate parity for said corresponding data stripes of said disk drives containing said general data before writing the calculated parity onto corresponding sectors of said disk drives containing parity data and before said disk drives containing said parity data have completed a full revolution after reading or writing said general data.
Claim 3
Dependent Claim 19 words
The computer system of claim 1, wherein each sector of said disk drives stores 512 bytes of digital data.
Claim 4
Dependent Claim 28 words
The data storage system of claim 1, wherein a stripe of data comprises the general data and the parity data stored on corresponding sectors of said disk drives.
Claim 5
Dependent Claim 52 words
The data storage system of claim 1, wherein the calculation of parity comprises the steps of reading data values of all corresponding sectors of said disk drives containing general data which are not being written to: and computing an exclusive OR (XOR) of said data read with data which is being written.
Claim 6
Dependent Claim 28 words
The computer system of claim 1, wherein the position skewing of the parity disk sectors is accomplished by low level formatting the sector skew onto said parity disk.
Claim 7
Dependent Claim 38 words
The data storage system of claim 1, wherein the position skewing of the parity disk sectors is accomplished by logically writing the parity data to parity disk sector N which is selected to provide a desired parity skew.
Claim 8
Independent Claim 244 words
A method for reducing write a write latency in redundant disk arrays in a computer system, said computer system including a processor, a random access memory and a multiple disk data storage system having multiple disks rotated by disk spindles, and in which rotational speed and angular position of the disk spindles are synchronized and wherein at least one of said multiple disks is a parity disk, and the other of said multiple disks are data disks, wherein parity of a data stripe write operation is calculated and written to said parity disk within a same disk rotation as a read and a write operation to said data disks, said method comprising the steps of: writing new data to sectors of at least one of said data disks; reading data from sectors of the other of said data disks which correspond with said written new data sectors; calculating parity of data stripes wherein said data stripes are comprised of said new data written and said data read; and writing said calculated parity to sectors of said parity disk which correspond with said sectors of said new data written and said data read within the same disk revolution that said new data was written, said parity disk having position skewed corresponding sectors so as to allow adequate time for reading data sectors containing existing stripe data, writing new data to corresponding data sectors, and calculating and writing parity of data stripes to said parity disk.
Claim 9
Independent Claim 244 words
A method for reducing write a write latency in redundant disk arrays in a computer system, said computer system including a processor, a random access memory and a multiple disk data storage system having multiple disks rotated by disk spindles, and in which rotational speed and angular position of the disk spindles are synchronized and wherein at least one of said multiple disks is a parity disk, and the other of said multiple disks are data disks, wherein parity of a data stripe write operation is calculated and written to said parity disk within a same disk rotation as a read and a write operation to said data disks, said method comprising the steps of: writing new data to sectors of at least one of said data disks; reading data from sectors of the other of said data disks which correspond with said written new data sectors; calculating parity of data stripes wherein said data stripes are comprised of said new data written and said data read; and writing said calculated parity to sectors of said parity disk which correspond with said sectors of said new data written and said data read within the same disk revolution that said new data was written, said parity disk having position skewed corresponding sectors so as to allow adequate time for reading data sectors containing existing stripe data, writing new data to corresponding data sectors, and calculating and writing parity of data stripes to said parity disk.

References Cited (Backward Citations)

US4641207A Cited
US4870643A Cited
US5077736A Cited
US5101492A Cited
US5072378A Cited
US5088081A Cited

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag