Optimized auto-tiering, wherein subset of data movements are selected, utilizing workload skew point, from a list that ranks data movements based on criteria other than I/O workload

Patent metadata

Field	Value
Publication number	US-10754573-B2
Application number	US-201715423657-A
Country	US
Kind code	B2
Filing date	Feb 3, 2017
Priority date	Mar 11, 2016
Publication date	Aug 25, 2020
Grant date	Aug 25, 2020

Abstract

Described are techniques for performing data movement optimization processing comprising: receiving a list of proposed data movements; ranking the list in accordance with one or more criteria associated with each of the proposed data movements of the list, wherein the one or more criteria for each proposed data movement, that moves a data portion to a target storage tier, includes at least one characteristic about each proposed data movement other than I/O workload directed to the data portion; selecting a subset of the proposed data movements of the list; implementing the subset of the proposed data movements by performing each of the proposed data movements of the subset; and revising the list to remove proposed data movements of the subset implemented in said implementing. A new list may be obtained each time period. A subset of the ranked list may be implemented each time period in a cycle.

First claim

What is claimed is:

1. A method of performing data movement optimization processing comprising:
receiving, using a processor, a list of proposed data movements for a plurality of data portions, wherein each proposed data movement of the list denotes a proposed movement of a data portion of the plurality of data portions from a source storage tier of a plurality of storage tiers to a target tier of the plurality of storage tiers, wherein the plurality of storage tiers are used for back-end data storage in a data storage system, and wherein each proposed data movement of the list denotes either a demotion, where the source storage tier is a higher performance tier than the target storage tier, or a promotion, where the source storage tier is a lower performance tier than the target storage tier;
ranking, using a processor, the list of proposed data movements in accordance with one or more criteria associated with each of the proposed data movements of the list, wherein the one or more criteria for said each proposed data movement includes at least one characteristic about said each proposed data movement other than I/O workload directed to the data portion of said each proposed data movement, wherein the one or more criteria for said each proposed data movement, that moves the data portion to the target storage tier, includes an indicator denoting whether the data portion includes file system metadata, wherein the file system metadata includes protection or access information indicating user permissions needed to access different data portions;
selecting, using a processor and in accordance with said ranking, a subset of the proposed data movements of the list, wherein the subset of the proposed data movements of the list is determined using a workload skew point denoting that a specified percentage of I/O workload of the plurality of data portions is directed to a specified percentage of busiest data portions of the plurality of data portions;
implementing, using a processor, the subset of the proposed data movements by performing each of the proposed data movements of the subset;
and revising, using a processor, the list to remove the subset of the proposed data movements implemented in said implementing.

2. The method of claim 1 , wherein the plurality of storage tiers are ranked based on performance.

3. The method of claim 2 , wherein the list of proposed data movements is generated by a data storage optimizer that automatically generates a new list of proposed data movements at each occurrence of a defined time period.

4. The method of claim 3 , wherein said ranking, said selecting, said implementing and said revising are repeated as a group at each occurrence of a defined time period within a cycle, wherein the cycle has a defined cycle time that is a multiple of the defined time period.

5. The method of claim 1 , wherein the one or more criteria include one or more primary criteria and one or more secondary criteria, and wherein each proposed data movement of the list meeting the one or more primary criteria is ranked higher by said ranking than any other proposed data movement of the list not meeting the primary criteria.

6. The method of claim 1 , wherein the one or more criteria includes a third level of criteria.

7. The method of claim 1 , wherein the one or more criteria for said each proposed data movement, that moves the data portion to the target storage tier, includes an indicator denoting whether the data portion includes application critical data.

8. The method of claim 1 , wherein the one or more criteria for said each proposed data movement, that moves the data portion to the target storage tier, includes an I/O workload for the data portion.

9. The method of claim 8 , wherein the I/O workload for the data portion denotes a cumulative I/O workload directed to the data portion for both reads and writes directed to the data portion.

10. The method of claim 1 , wherein the one or more criteria for said each proposed data movement, that moves the data portion to the target storage tier, includes one of a predefined set of application priorities denoting an application priority for an application using the data included in the data portion of said each proposed data movement.

11. The method of claim 1 , wherein the one or more criteria for said each proposed data movement, that moves the data portion to the target storage tier, includes one of a predefined set of quality of service levels denoting a priority or a level of importance of the data portion of said each proposed data movement, wherein the priority or the level of importance of the data portion of said each proposed data movement is with respect to an application using the data included in the data portion of said each proposed data movement.

12. The method of claim 1 , wherein a first of the plurality of storage tiers includes physical storage devices having a first write endurance and a second of the plurality of storage tiers includes physical storage devices having a second write endurance greater than the first write endurance.

13. The method of claim 12 , wherein the first endurance denotes that physical storage devices of the first storage tier wear out and are expected to sustain an expected number of write or erasure cycles that is less than a second expected number of write or erasure cycles associated with physical devices of the second storage tier.

14. The method of claim 13 , wherein the first and the second storage tiers are tiers of different flash-based physical drives.

15. The method of claim 14 , wherein the one or more criteria for said each proposed data movement, that moves the data portion to the target storage tier, includes an indicator denoting whether I/O workload directed to the data portion is read heavy or write heavy.

16. The method of claim 1 , wherein the subset of the proposed data movements is further determined using a specified increase in performance expected as a result of modeling implementation of a number of the proposed data movements of the list as ranked by said ranking.

17. A system comprising:
one or more processors;
and one or more memories comprising code stored thereon that, when executed, performs a method comprising:
receiving, using a processor, a list of proposed data movements for a plurality of data portions, wherein each proposed data movement of the list denotes a proposed movement of a data portion of the plurality of data portions from a source storage tier of a plurality of storage tiers to a target tier of the plurality of storage tiers, wherein the plurality of storage tiers are used for back-end data storage in a data storage system, and wherein each proposed data movement of the list denotes either a demotion, where the source storage tier is a higher performance tier than the target storage tier, or a promotion, where the source storage tier is a lower performance tier than the target storage tier;
ranking, using a processor, the list of proposed data movements in accordance with one or more criteria associated with each of the proposed data movements of the list, wherein the one or more criteria for said each proposed data movement includes at least one characteristic about said each proposed data movement other than I/O workload directed to the data portion of said each proposed data movement, wherein the one or more criteria for said each proposed data movement, that moves the data portion to the target storage tier, includes an indicator denoting whether the data portion includes file system metadata, wherein the file system metadata includes prot

Assignees

• Emc Ip Holding Co Llc

Inventors

• Dalmatov Nickolay A
• Shatunov Vladimir

Classifications

• G06F3/0685

  Hybrid storage combining heterogeneous device types, e.g. hierarchical storage, hybrid arrays · CPC title

• G06F3/0605

  by facilitating the interaction with a user or administrator · CPC title

• G06F3/0659

  Command handling arrangements, e.g. command buffers, queues, command scheduling · CPC title

• G06F3/0649 Primary

  Lifecycle management · CPC title