US6532548B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
System and method for handling temporary errors on a redundant array of independent tapes (RAIT)
Assignee: Oracle America Inc
•
Filing: 1999-09-21
•
Granted: 2003-03-11
•
Expires: 2019-09-21
Abstract
Abstract A system and method for storing data in a storage system having storage elements arranged in parallel for concurrent access such that data can be continuously communicated to the storage element array while one of the storage elements is in error recovery. Some of the storage elements receive data of a stripe and the remaining storage elements receive parity information based on the data of the stripe. An unresponsive storage element in error recovery is dropped from the other storage elements for receiving data until error recovery is complete and the storage element is responsive for receiving data. While the storage element is unresponsive, one of the storage elements scheduled to receive parity information receives data to be written to the unresponsive storage element instead of the parity information. Communication to the storage elements continues while the failed storage element is in error recovery. Error recovery is accomplished by using the parity information of the other parity information storage elements.
Inventors
- 👤 James P. Hughes
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 19:54
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1076; G06F11/1084; G06F2211/00; G06F2211/10; G06F2211/1002; G06F2211/108
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
230 words
A method for storing data in a storage system having N storage elements arranged in parallel for concurrent access, wherein N is an integer greater than three, wherein N−2 of the N storage elements are designated as data storage elements for each row of data and the remaining two of the N storage elements are designated as first and second redundant information storage elements for each row of data, the method comprising: determining first redundancy information based on a first row of data to be striped across the N−2 storage elements; determining first additional redundancy information based on the first row of data to be striped across the N−2 storage elements and the determined first redundancy information; determining which of the N−2 storage elements are responsive for receiving data; striping the first row of data across the responsive storage elements of the N−2 storage elements if at least N−3 of the N−2 storage elements are responsive for receiving data; writing the first redundancy information to the first redundant information storage element; writing the first additional redundancy information to the second redundant information storage element if all of the N−2 storage elements are responsive for receiving data; and writing the data to be received by one of the N−2 storage elements to the second redundant information storage element if the one of the N−2 storage elements is unresponsive for receiving data.
Claim 2
Independent Claim
230 words
A method for storing data in a storage system having N storage elements arranged in parallel for concurrent access, wherein N is an integer greater than three, wherein N−2 of the N storage elements are designated as data storage elements for each row of data and the remaining two of the N storage elements are designated as first and second redundant information storage elements for each row of data, the method comprising: determining first redundancy information based on a first row of data to be striped across the N−2 storage elements; determining first additional redundancy information based on the first row of data to be striped across the N−2 storage elements and the determined first redundancy information; determining which of the N−2 storage elements are responsive for receiving data; striping the first row of data across the responsive storage elements of the N−2 storage elements if at least N−3 of the N−2 storage elements are responsive for receiving data; writing the first redundancy information to the first redundant information storage element; writing the first additional redundancy information to the second redundant information storage element if all of the N−2 storage elements are responsive for receiving data; and writing the data to be received by one of the N−2 storage elements to the second redundant information storage element if the one of the N−2 storage elements is unresponsive for receiving data.
Claim 3
Dependent Claim
13 words
The method of claim 1 wherein: the storage elements are magnetic tape drives.
Claim 4
Dependent Claim
13 words
The method of claim 1 wherein: the storage elements are magnetic disk drives.
Claim 5
Dependent Claim
237 words
A data storage system comprising: N storage elements arranged in parallel for concurrent access, wherein N is an integer greater than three, wherein N−2 of the N storage elements are designated as data storage elements for each row of data and the remaining two of the N storage elements are designated as first and second redundant information storage elements for each row of data; and a controller connected to each of the N storage elements, the controller operable for determining first redundancy information based on a first row of data to be striped across the N−2 storage elements, determining first additional redundancy information based on the determined first redundancy information and the first row of data to be striped across the N−2 storage elements, determining which of the N−2 storage elements are responsive for receiving data, striping the first row of data across the responsive storage elements of the N−2 storage elements if at least N−3 of the N−2 storage elements are responsive for receiving data, writing the first redundancy information to the first redundant information storage element, writing the first additional redundancy information to the second redundant information storage element if all of the N−2 storage elements are responsive for receiving data, and writing the data to be received by one of the N−2 storage elements to the second redundant information storage element if the one of the N−2 storage elements is unresponsive for receiving data.
Claim 6
Dependent Claim
237 words
A data storage system comprising: N storage elements arranged in parallel for concurrent access, wherein N is an integer greater than three, wherein N−2 of the N storage elements are designated as data storage elements for each row of data and the remaining two of the N storage elements are designated as first and second redundant information storage elements for each row of data; and a controller connected to each of the N storage elements, the controller operable for determining first redundancy information based on a first row of data to be striped across the N−2 storage elements, determining first additional redundancy information based on the determined first redundancy information and the first row of data to be striped across the N−2 storage elements, determining which of the N−2 storage elements are responsive for receiving data, striping the first row of data across the responsive storage elements of the N−2 storage elements if at least N−3 of the N−2 storage elements are responsive for receiving data, writing the first redundancy information to the first redundant information storage element, writing the first additional redundancy information to the second redundant information storage element if all of the N−2 storage elements are responsive for receiving data, and writing the data to be received by one of the N−2 storage elements to the second redundant information storage element if the one of the N−2 storage elements is unresponsive for receiving data.
Claim 7
Dependent Claim
13 words
The system of claim 4 wherein: the storage elements are magnetic tape drives.
Claim 8
Dependent Claim
13 words
The system of claim 4 wherein: the storage elements are magnetic disk drives.
References Cited (Backward Citations)
US4205324A
Cited
EP0462917A2
Cited
US5258984A
Cited
EP0519669A2
Cited
EP0559487A2
Cited
US5550998A
Cited
US5390327A
Cited
US5499253A
Cited
US5911150A
Cited
US5566316A
Cited
US5671349A
Cited
US5537534A
Cited
US5812753A
Cited
US6070249A
Cited
US5859965A
Cited
US5893164A
Cited
US6101615A
Cited
US6223323B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2006-03-10 | 2006-09-09 | 2007-03-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2010-03-10 | 2010-09-09 | 2011-03-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2014-03-10 | 2014-09-09 | 2015-03-11 | $7700.00 | Window Closed / Lapsed |