Computer data storage system with parallelization migration plan generator
US6571258B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Sep 13, 1999 |
| Grant date | May 27, 2003 |
| Priority date | — |
| Expiry date | Sep 13, 2019 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99955
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A data storage system is provided in which a migration plan generates migration plans for reaching a goal configuration from an initial configuration in a predetermined period of time. The migration plan initially makes terminal moves until no further terminal moves can be made. A shunt move is then made based on reducing the contention (the total size of the data stores that need to be moved onto a particular data stores device divided by the amount of excess capacity on the data storage device). The shunt is selected to lead to the lowest contention for the data storage system. Subsequently, the migration plan returns to making terminal moves to develop a migration plan. By determining existence and utilization dependencies of the various moves, independent moves are determined to be implemented in parallel with moves having dependencies. This produces parallelized migration plans which run much faster than sequential migration plans.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.