System and method for LUN adjustment

• US 8,930,746 B1
• Filed: 06/30/2012
• Issued: 01/06/2015
• Est. Priority Date: 06/30/2012
• Status: Active Grant

• Current Assignee: Emc IP Holding Company LLC (Dell Technologies Inc.)
• Original Assignee: EMC Corporation (Dell Technologies Inc.)
• Inventors: Chen, Xiangping, de Forest, Miles A., Linnell, Thomas E., Duprey, Dennis Thomas, Can, Khang
• Primary Examiner(s): Lottich, Joshua P
• Application Number:
  US13/539,438
• Time in Patent Office: 920 Days
• Field of Search: 714/6.13, 714/6.3, 714/6.31, 714/6.32
• US Class Current: 714/6.13
• CPC Class Codes: G06F 11/0727 in a storage system, e.g. in a DASD or network based storage system drivers for digital recording or reproducing units G06F3/06; circuits for error detection or correction within digital recording or reproducing units G11B20/18; for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS], H04L67/1097
• CPC Class Codes: G06F 11/0793 Remedial or corrective actions recovery from an exception in an instruction pipeline G06F9/3861; by retry G06F11/1402; for recovering from a failure of a protocol instance or entity H04L69/40

Abstract

A method, computer program product, and computing system for identifying at least one misassigned slice that is associated with a first data tier and is located in a first front end LUN. The at least one misassigned slice is being accessed contrary to the first data tier. The failure domain of the first front end LUN is determined. At least one replacement slice that is associated with a second data tier and is located in a second front end LUN is identified based, at least in part, upon the failure domain of the first front end LUN. The at least one misassigned slice is moved to the second front end LUN. The at least one replacement slice is moved to the first front end LUN.

Claims

1. A computer-implemented method comprising:

identifying at least one misassigned slice that is associated with a first data tier and is located in a first front end LUN, wherein the at least one misassigned slice is being accessed contrary to the first data tier;

determining the failure domain of the first front end LUN;

identifying at least one replacement slice that is associated with a second data tier and is located in a second front end LUN based, at least in part, upon the failure domain of the first front end LUN;

moving the at least one misassigned slice to the second front end LUN; and

moving the at least one replacement slice to the first front end LUN.

2. The computer-implemented method of claim 1 wherein identifying at least one misassigned slice includes identifying colder slices that are located in a hotter data tier.

3. The computer-implemented method of claim 1 wherein identifying at least one misassigned slice includes identifying hotter slices that are located in a colder data tier.

4. The computer-implemented method of claim 1 wherein the failure domain is based upon a quantity of backend devices contributing slices to the first front end LUN.

5. The computer-implemented method of claim 1 wherein the first data tier and the second data tier are chosen from the group consisting of:

a higher performance data tier, a medium performance data tier, and a slower performance data tier.

6. The computer-implemented method of claim 1 wherein the first front end LUN is constructed from a plurality of backend LUN slices.

7. The computer-implemented method of claim 6 wherein the plurality of backend LUN slices are slices of one or more backend LUNs.

8. A computer program product residing on a non-transitory computer readable medium having a plurality of instructions stored thereon which, when executed by a processor, cause the processor to perform operations comprising:

identifying at least one misassigned slice that is associated with a first data tier and is located in a first front end LUN, wherein the at least one misassigned slice is being accessed contrary to the first data tier;

determining the failure domain of the first front end LUN;

identifying at least one replacement slice that is associated with a second data tier and is located in a second front end LUN based, at least in part, upon the failure domain of the first front end LUN;

moving the at least one misassigned slice to the second front end LUN; and

moving the at least one replacement slice to the first front end LUN.

9. The computer program product of claim 8 wherein identifying at least one misassigned slice includes identifying colder slices that are located in a hotter data tier.

10. The computer program product of claim 8 wherein identifying at least one misassigned slice includes identifying hotter slices that are located in a colder data tier.

11. The computer program product of claim 8 wherein the failure domain is based upon a quantity of backend devices contributing slices to the first front end LUN.

12. The computer program product of claim 8 wherein the first data tier and the second data tier are chosen from the group consisting of:

a higher performance data tier, a medium performance data tier, and a slower performance data tier.

13. The computer program product of claim 8 wherein the first front end LUN is constructed from a plurality of backend LUN slices.

14. The computer program product of claim 13 wherein the plurality of backend LUN slices are slices of one or more backend LUNs.

15. A computing system including at least one processor and at least one memory architecture coupled with the at least one processor, wherein the computing system is configured to perform operations comprising:

identifying at least one misassigned slice that is associated with a first data tier and is located in a first front end LUN, wherein the at least one misassigned slice is being accessed contrary to the first data tier;

determining the failure domain of the first front end LUN;

identifying at least one replacement slice that is associated with a second data tier and is located in a second front end LUN based, at least in part, upon the failure domain of the first front end LUN;

moving the at least one misassigned slice to the second front end LUN; and

moving the at least one replacement slice to the first front end LUN.

16. The computing system of claim 15 wherein identifying at least one misassigned slice includes identifying colder slices that are located in a hotter data tier.

17. The computing system of claim 15 wherein identifying at least one misassigned slice includes identifying hotter slices that are located in a colder data tier.

18. The computing system of claim 15 wherein the failure domain is based upon a quantity of backend devices contributing slices to the first front end LUN.

19. The computing system of claim 15 wherein the first data tier and the second data tier are chosen from the group consisting of:

a higher performance data tier, a medium performance data tier, and a slower performance data tier.

20. The computing system of claim 15 wherein the first front end LUN is constructed from a plurality of backend LUN slices.

21. The computing system of claim 20 wherein the plurality of backend LUN slices are slices of one or more backend LUNs.