Techniques for managing placement of extents based on a history of active extents

• US 8,782,324 B1
• Filed: 06/28/2012
• Issued: 07/15/2014
• Est. Priority Date: 06/28/2012
• Status: Active Grant

• Current Assignee: Emc IP Holding Company LLC (Dell Technologies Inc.)
• Original Assignee: EMC Corporation (Dell Technologies Inc.)
• Inventors: Chen, Xiangping, Armangau, Philippe
• Primary Examiner(s): CHOE, YONG J
• Application Number:
  US13/536,371
• Time in Patent Office: 747 Days
• Field of Search: 711/102, 711/103
• US Class Current: 711/102
• CPC Class Codes: G06F 12/0238 Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
• CPC Class Codes: G06F 3/0608 Saving storage space on storage systems
• CPC Class Codes: G06F 3/0611 in relation to response time
• CPC Class Codes: G06F 3/0644 Management of space entities, e.g. partitions, extents, pools
• CPC Class Codes: G06F 3/0649 Lifecycle management
• CPC Class Codes: G06F 3/0665 at area level, e.g. provisioning of virtual or logical volumes
• CPC Class Codes: G06F 3/0688 Non-volatile semiconductor memory arrays

Abstract

A technique of managing data placement involves constructing an active extent list which identifies active extents stored in a storage pool based on a history of extent activity. The technique further involves based on the active extent list, generating preferred extent-tier pairings for extents of a particular LUN slice that are initially stored on a first tier of the pool, the preferred extent-tier pairings matching (i) a first extent of that LUN slice to the first tier and (ii) a second extent of that LUN slice to a second tier of the pool. The technique further involves, based on the preferred extent-tier pairings, maintaining the first extent on the first tier and relocating the second extent from the first tier to the second tier to distribute the first and second extents of that LUN slice across multiple tiers of the pool in accordance with the extent activity history.

Claims

1. In a data storage apparatus having (i) processing circuitry and (ii) a pool of non-volatile storage which stores extents, a method of managing placement of the extents within the pool of non-volatile storage, the method comprising:

constructing, by the processing circuitry, an active extent list which identifies active extents stored in the pool of non-volatile storage based on a history of extent activity;

based on the active extent list, generating a set of preferred extent-tier pairings for extents of a particular logical unit (LUN) slice that are initially stored on a first tier of the pool of non-volatile storage, the set of preferred extent-tier pairings matching (i) a first extent of the particular LUN slice to the first tier of the pool of non-volatile storage and (ii) a second extent of the particular LUN slice to a second tier of the pool of non-volatile storage; and

based on the set of preferred extent-tier pairings, maintaining storage of the first extent of the particular LUN slice on the first tier of the pool of non-volatile storage and relocating storage of the second extent of the particular LUN slice from the first tier of the pool of non-volatile storage to the second tier of the pool of non-volatile storage to distribute storage of the first and second extents of the particular LUN slice across multiple tiers of the pool of non-volatile storage in accordance with the history of extent activity.

2. The method as in claim 1 wherein the second tier of the pool of non-volatile storage includes a LUN-slice-sized memory area having a filled portion which currently stores host data and an empty portion which is currently free to store host data;

and wherein relocating storage of the second extent of the particular LUN slice from the first tier to the second tier includes;

repositioning the second extent from the first tier to the empty portion of the LUN-slice-sized memory area of the second tier.

3. The method as in claim 2 wherein the active extent list includes a ranking of extents according to the history of extent activity;

and wherein generating the set of preferred extent-tier pairings includes;

based on the ranking of extents of the active extent list, selecting (i) certain extents to move from the first tier to the second tier and (ii) other extents to continue to store in the first tier, the second extent of the particular LUN slice being among the certain extents selected to be moved from the first tier to the second tier.

4. The method as in claim 3 wherein selecting certain extents to move from the first tier to the second tier and other extents to continue to store in the first tier includes:

prior to copying the second extent from the first tier to the empty portion of the LUN-slice-sized memory area of the second tier, identifying LUN-slice-sized memory areas of the second tier which have empty portions which are currently free to store host data.

5. The method as in claim 4, further comprising:

prior to copying the second extent from the first tier to the empty portion of the LUN-slice-sized memory area of the second tier, evacuating LUN slices of host data from the second tier to the first tier to increase available storage space in the second tier.

6. The method as in claim 4 wherein the ranking of the active extent list indicates that the second extent was accessed more than the first extent during a recent common period of time;

wherein the pool of non-volatile storage includes (i) a faster set of storage devices having faster access speeds as the first tier, and (ii) a slower set of storage devices having slower access speeds as the second tier; and

wherein generating the set of preferred extent-tier pairings applying a relocation policy to the ranking which results in selection of (i) the second tier as the preferred destination of the second extent, and (ii) the first tier as the preferred destination of the first extent.

7. The method as in claim 6 wherein repositioning the second extent from the first tier to the empty portion of the LUN-slice-sized memory area of the second tier includes:

copying the second extent from the slower set of storage devices to the faster set of storage devices, and deleting the second extent from the slower set of storage devices.

8. The method as in claim 6 wherein the data storage apparatus further has a buffer cache which is separate from the slower set of storage devices and the faster set of storage devices;

and wherein the method further comprises;

after repositioning the second extent from the first tier to the empty portion of the LUN-slice-sized memory area of the second tier, temporarily caching copies of the first and second extents of the particular LUN slice in the buffer cache as the copies of the first and second extents are accessed by a set of host devices, the first extent continuing to reside in the first tier and second extent continuing to reside in the second tier while the copies of the first and second extents are temporarily cached in the buffer cache during access by the host devices.

9. The method as in claim 4 wherein repositioning the second extent from the first tier to the empty portion of the LUN-slice-sized memory area of the second tier includes:

waiting until the data storage apparatus has entered a relocation time window characterized by low host input/output activity, and

after waiting until the data storage apparatus has entered the relocation time window, copying the second extent from the first tier to the empty portion of the LUN-slice-sized memory area of the second tier, and deleting the second extent from the first tier.

10. The method as in claim 4, further comprising:

prior to constructing the active extent list, obtaining the history of extent activity from a lock history database which identifies extents which were recently locked by host input/output (IO) operations.

11. A data storage apparatus, comprising:

a host interface;

a pool of non-volatile storage which stores extents; and

processing circuitry coupled to the host interface and the pool of non-volatile storage, the processing circuitry (i) processing host input/output (IO) operations received through the host interface and (ii) managing data placement of the extents;

wherein the processing circuitry, when managing data placement of the extents, is constructed and arranged to;

construct an active extent list which identifies active extents stored in the pool of non-volatile storage based on a history of extent activity,

based on the active extent list, generate a set of preferred extent-tier pairings for extents of a particular logical unit (LUN) slice that are initially stored on a first tier of the pool of non-volatile storage, the set of preferred extent-tier pairings matching (i) a first extent of the particular LUN slice to the first tier of the pool of non-volatile storage and (ii) a second extent of the particular LUN slice to a second tier of the pool of non-volatile storage, and

based on the set of preferred extent-tier pairings, maintain storage of the first extent of the particular LUN slice on the first tier of the pool of non-volatile storage and relocate storage of the second extent of the particular LUN slice from the first tier of the pool of non-volatile storage to the second tier of the pool of non-volatile storage to distribute storage of the first and second extents of the particular LUN slice across multiple tiers of the pool of non-volatile storage in accordance with the history of extent activity.

12. The data storage apparatus as in claim 11 wherein the second tier of the pool of non-volatile storage includes a LUN-slice-sized memory area having a filled portion which currently stores host data and an empty portion which is currently free to store host data;

and wherein the processing circuitry, when relocating storage of the second extent of the particular LUN slice from the first tier to the second tier, is constructed and arranged to;

reposition the second extent from the first tier to the empty portion of the LUN-slice-sized memory area of the second tier.

13. The data storage apparatus as in claim 12 wherein the active extent list includes a ranking of extents according to the history of extent activity;

and wherein the processing circuitry, when generating the set of preferred extent-tier pairings, is constructed and arranged to;

based on the ranking of extents of the active extent list, select (i) certain extents to move from the first tier to the second tier and (ii) other extents to continue to store in the first tier, the second extent of the particular LUN slice being among the certain extents selected to be moved from the first tier to the second tier.

14. The data storage apparatus as in claim 13 wherein the processing circuitry, when selecting certain extents to move from the first tier to the second tier and other extents to continue to store in the first tier, is constructed and arranged to:

prior to copying the second extent from the first tier to the empty portion of the LUN-slice-sized memory area of the second tier, identify LUN-slice-sized memory areas of the second tier which have empty portions which are currently free to store host data.

15. The data storage apparatus as in claim 14 wherein the processing circuitry is further constructed and arranged to:

prior to copying the second extent from the first tier to the empty portion of the LUN-slice-sized memory area of the second tier, evacuate LUN slices of host data from the second tier to the first tier to increase available storage space in the second tier.

16. A computer program product having a non-transitory computer readable medium storing a set of instructions which, when carried out by a computerized device having access to a pool of non-volatile storage, directs the computerized device to manage placement of extents by performing a method comprising:

constructing an active extent list which identifies active extents stored in the pool of non-volatile storage based on a history of extent activity;

based on the active extent list, generating a set of preferred extent-tier pairings for extents of a particular logical unit (LUN) slice that are initially stored on a first tier of the pool of non-volatile storage, the set of preferred extent-tier pairings matching (i) a first extent of the particular LUN slice to the first tier of the pool of non-volatile storage and (ii) a second extent of the particular LUN slice to a second tier of the pool of non-volatile storage; and

based on the set of preferred extent-tier pairings, maintaining storage of the first extent of the particular LUN slice on the first tier of the pool of non-volatile storage and relocating storage of the second extent of the particular LUN slice from the first tier of the pool of non-volatile storage to the second tier of the pool of non-volatile storage to distribute storage of the first and second extents of the particular LUN slice across multiple tiers of the pool of non-volatile storage in accordance with the history of extent activity.

17. The computer program product as in claim 16 wherein the second tier of the pool of non-volatile storage includes a LUN-slice-sized memory area having a filled portion which currently stores host data and an empty portion which is currently free to store host data;

and wherein relocating storage of the second extent of the particular LUN slice from the first tier to the second tier includes;

repositioning the second extent from the first tier to the empty portion of the LUN-slice-sized memory area of the second tier.

18. The computer program product as in claim 17 wherein the active extent list includes a ranking of extents according to the history of extent activity;

and wherein generating the set of preferred extent-tier pairings includes;

based on the ranking of extents of the active extent list, selecting (i) certain extents to move from the first tier to the second tier and (ii) other extents to continue to store in the first tier, the second extent of the particular LUN slice being among the certain extents selected to be moved from the first tier to the second tier.

19. The computer program product as in claim 18 wherein selecting certain extents to move from the first tier to the second tier and other extents to continue to store in the first tier includes:

prior to copying the second extent from the first tier to the empty portion of the LUN-slice-sized memory area of the second tier, identifying LUN-slice-sized memory areas of the second tier which have empty portions which are currently free to store host data.

20. The computer program product as in claim 19, further comprising:

prior to copying the second extent from the first tier to the empty portion of the LUN-slice-sized memory area of the second tier, evacuating LUN slices of host data from the second tier to the first tier to increase available storage space in the second tier.