System and method for capacity management in multi-tiered storage

• US 10,496,318 B1
• Filed: 04/28/2017
• Issued: 12/03/2019
• Est. Priority Date: 04/28/2017
• Status: Active Grant

• Current Assignee: Emc IP Holding Company LLC (Dell Technologies Inc.)
• Original Assignee: Emc IP Holding Company LLC (Dell Technologies Inc.)
• Inventors: Danilov, Mikhail, Buinov, Konstantin, Rakulenko, Alexander, Skripko, Gregory, Gusakov, Kirill
• Primary Examiner(s): Chappell, Daniel C.
• Application Number:
  US15/582,170
• Time in Patent Office: 949 Days
• CPC Class Codes: G06F 3/0605 by facilitating the interaction with a user or administrator
• CPC Class Codes: G06F 3/0608 Saving storage space on storage systems
• CPC Class Codes: G06F 3/0647 Migration mechanisms
• CPC Class Codes: G06F 3/0649 Lifecycle management
• CPC Class Codes: G06F 3/067 Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
• CPC Class Codes: G06F 3/0685 Hybrid storage combining heterogeneous device types, e.g. hierarchical storage, hybrid arrays

Abstract

One embodiment is related to a method for promoting or demoting data objects in a multi-tier storage system, comprising: creating one or more chunks to store data objects therein at a first tier of the multi-tier storage system, wherein data objects stored in each chunk are associated with a same lifecycle policy and an approximately same creation time; and moving one of the one or more chunks to a second tier in its entirety based on the lifecycle policy associated with the data objects stored in the moved chunk.

Claims

1. A method for promoting or demoting data objects in a multi-tier storage system, comprising:

creating one or more chunks to store a plurality of data objects in the one or more chunks at a first tier of the multi-tier storage system, wherein each of the one or more chunks is a block of storage space of a fixed size in the multi-tier storage system, and wherein all data objects stored in each chunk are associated with a same lifecycle policy and an approximately same creation time; and

moving one of the one or more chunks to a second tier in its entirety based on the lifecycle policy associated with the data objects stored in the moved chunk, wherein the multi-tier storage system comprises a chunk table that associates chunks with their locations in the multi-tier storage system, wherein moving the chunk of the plurality of data objects to the second tier comprises updating the chunk table to reflect moving the moved chunk to the second tier.

2. The method of claim 1, wherein the second tier is a lower tier than the first tier.

3. The method of claim 1, wherein the second tier is a higher tier than the first tier.

4. The method of claim 1, wherein the multi-tier storage system comprises three or more tiers.

5. The method of claim 1, wherein the lifecycle policy associated with the data object specifies a time period for which the data objects are to be stored at the first tier before being moved to the second tier.

6. The method of claim 1, wherein data object location information that associates the data objects stored in the moved with the moved chunk is not changed when the moved chunk is moved to the second tier.

7. A non-transitory machine-readable medium having instructions stored therein which, when executed by a processor, cause the processor to perform storage operations, the storage operations comprising:

creating one or more chunks to store a plurality of data objects in the one or more chunks at a first tier of a multi-tier storage system, wherein each of the one or more chunks is a block of storage space of a fixed size in the multi-tier storage system, and wherein all data objects stored in each chunk are associated with a same lifecycle policy and an approximately same creation time; and

moving one of the one or more chunks to a second tier in its entirety based on the lifecycle policy associated with the data objects stored in the moved chunk, wherein the multi-tier storage system comprises a chunk table that associates chunks with their locations in the multi-tier storage system, wherein moving the chunk of the plurality of data objects to the second tier comprises updating the chunk table to reflect moving the moved chunk to the second tier.

8. The non-transitory machine-readable medium of claim 7, wherein the second tier is a lower tier than the first tier.

9. The non-transitory machine-readable medium of claim 7, wherein the second tier is a higher tier than the first tier.

10. The non-transitory machine-readable medium of claim 7, wherein the multi-tier storage system comprises three or more tiers.

11. The non-transitory machine-readable medium of claim 7, wherein the lifecycle policy associated with the data object specifies a time period for which the data objects are to be stored at the first tier before being moved to the second tier.

12. The non-transitory machine-readable medium of claim 7, wherein data object location information that associates the data objects stored in the moved chunk with the moved chunk is not changed when the moved chunk is moved to the second tier.

13. A data processing system, comprising:

a processor; and

a memory coupled to the processor storing instructions which, when executed by the processor, cause the processor to perform storage operations, the storage operations including

creating one or more chunks to store a plurality of data objects in the one or more chunks at a first tier of a multi-tier storage system, wherein each of the one or more chunks is a block of storage space of a fixed size in the multi-tier storage system, and wherein all data objects stored in each chunk are associated with a same lifecycle policy and an approximately same creation time; and

moving one of the one or more chunks to a second tier in its entirety based on the lifecycle policy associated with the data objects stored in the moved chunk, wherein the multi-tier storage system comprises a chunk table that associates chunks with their locations in the multi-tier storage system, wherein moving the chunk of the plurality of data objects to the second tier comprises updating the chunk table to reflect moving the moved chunk to the second tier.

14. The data processing system of claim 13, wherein the second tier is a lower tier than the first tier.

15. The data processing system of claim 13, wherein the second tier is a higher tier than the first tier.

16. The data processing system of claim 13, wherein the multi-tier storage system comprises three or more tiers.

17. The data processing system of claim 13, wherein the lifecycle policy associated with the data object specifies a time period for which the data objects are to be stored at the first tier before being moved to the second tier.

18. The data processing system of claim 13, wherein data object location information that associates the data objects stored in the moved chunk with the moved chunk is not changed when the moved chunk is moved to the second tier.