Virtual container storage interface controller
US-12175078-B2 · Dec 24, 2024 · US
US2017285943A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2017285943-A1 |
| Application number | US-201615334861-A |
| Country | US |
| Kind code | A1 |
| Filing date | Oct 26, 2016 |
| Priority date | Mar 30, 2016 |
| Publication date | Oct 5, 2017 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A technique for use in balancing flash drive wear in data storage systems is disclosed. multiple sets of flash drives are identified where data is stored as multiple slices striped across the set of flash drives. A write rate at which data will be written to the multiple slices stored on the set of flash drives during a next time interval is predicted. A number of bytes that can be written to each set of flash drives is determined. A metric representative of a wear rate is determined for each set of flash drives. Flash drive wear rate is balanced such that the wear rate for each of the multiple is approximately equal.
Opening claim text (preview).
What is claimed is: 1 . A method for use in balancing flash drive wear in data storage systems, the method comprising: identifying multiple sets of flash drives, wherein each set of flash drives store data arranged in multiple slices striped across the set of flash drives; predicting, for each set of flash drives, a write rate at which data will be written to the multiple slices stored on the set of flash drives during a next time interval; determining, for each set of flash drives, a number of bytes that can be written to each set of flash drives, wherein the number is based on a remaining program/erase (PE) cycle count for each respective set of flash drives; determining, for each set of flash drives, a metric representative of a wear rate, the metric based on a respective flash drives determined predicted write rate and the determined number of bytes that can be written to each set of flash drives; and balancing the wear rate of the multiple sets of flash drives based on each respective flash drives wear rate. 2 . The method as claimed in claim 1 , wherein predicting the write rate includes identifying one or more actual write rates occurring during one or more corresponding time intervals occurring substantially immediately prior to the next time interval. 3 . The method as claimed in claim 1 , wherein predicting the write rate includes identifying one or more actual write rates occurring during one or more corresponding time intervals occurring substantially immediately prior to the next time interval, wherein the predicted write rate is a function of the identified one or more actual write rates. 4 . The method as claimed in claim 1 , wherein balancing includes identifying a first set of flash drives having a higher wear rate than a second set of flash drives and remapping one or more slices from the first set of flash drives to the second set of flash drives. 5 . A system for use in balancing flash drive wear in data storage systems, the system comprising: a storage processor and memory configured to: identify multiple sets of flash drives, wherein each set of flash drives store data arranged in multiple slices striped across the set of flash drives; predict, for each set of flash drives, a write rate at which data will be written to the multiple slices stored on the set of flash drives during a next time interval; determine, for each set of flash drives, a number of bytes that can be written to each set of flash drives, wherein the number is based on a remaining program/erase (PE) cycle count for each respective set of flash drives; determine, for each set of flash drives, a metric representative of a wear rate, the metric based on a respective flash drives determined predicted write rate and the determined number of bytes that can be written to each set of flash drives; and balance the wear rate of the multiple sets of flash drives based on each respective flash drives wear rate. 6 . A computer-program product including a non-transitory computer-readable storage medium encoded with computer-program code that, when executed on a processor of a computer, causes the computer to manage data storage in a data storage system, the computer-program product further comprising: identifying multiple sets of flash drives, wherein each set of flash drives store data arranged in multiple slices striped across the set of flash drives; predicting, for each set of flash drives, a write rate at which data will be written to the multiple slices stored on the set of flash drives during a next time interval; determining, for each set of flash drives, a number of bytes that can be written to each set of flash drives, wherein the number is based on a remaining program/erase (PE) cycle count for each respective set of flash drives; determining, for each set of flash drives, a metric representative of a wear rate, the metric based on a respective flash drives determined predicted write rate and the determined number of bytes that can be written to each set of flash drives; and balancing the wear rate of the multiple sets of flash drives based on each respective flash drives wear rate.
by allocating resources to storage systems · CPC title
in block erasable memory, e.g. flash memory · CPC title
Improving I/O performance · CPC title
Wear leveling · CPC title
Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.