Data storage method for DASD arrays using striping based on file length
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Aug 15, 1995
Grant Date -
N/A
app pub date -
Jan 24, 1992
filing date -
Jan 24, 1992
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
In a data storage method for checksum DASD arrays, files are classified by length and/or other characteristic. Each relatively shorter file is written to an address or contiguous addresses typically on a single DASD of the array. The checksum stored on a checksum DASD is updated by reading the existing checksum, XORing that with the new data and writing the new checksum. Each relatively longer file is subdivided into portions all of the same size, and the number of equal portions is equal to the number of data DASDs where the file is to be written. The portions are interleaved in a stripe of addresses on the data DASDs, and the checksum of the portions is written to the checksum DASD. The characteristic transition length is dynamically varied in order that each interleaved file is provided with contiguous addresses matched to the file size.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully