STORAGE OPTIMIZATION MANAGER

• US 20120084270A1
• Filed: 06/10/2011
• Published: 04/05/2012
• Est. Priority Date: 10/04/2010
• Status: Active Grant

• Current Assignee: Quest Software, Inc.
• Original Assignee: Dell Products LP (Dell Technologies Inc.)
• Inventors: Jayaraman, Vinod, Dinkar, Abhijit, Taylor, Mark, Rao, Goutham, Root, Michael E., Bashyam, Murali
• Granted Patent: US 9,201,890 B2
• Time in Patent Office: Days
• US Class Current: 707/692
• CPC Class Codes: G06F 16/1748 De-duplication implemented within the file system, e.g. based on file segments de-duplication techniques in storage systems for the management of data blocks G06F3/0641
• CPC Class Codes: G06F 16/182 Distributed file systems
• CPC Class Codes: G06F 3/0604 Improving or facilitating administration, e.g. storage management
• CPC Class Codes: G06F 3/0608 Saving storage space on storage systems
• CPC Class Codes: G06F 3/0641 De-duplication techniques
• CPC Class Codes: G06F 3/0643 Management of files
• CPC Class Codes: G06F 3/0647 Migration mechanisms
• CPC Class Codes: G06F 3/0667 at data level, e.g. file, record or object virtualisation
• CPC Class Codes: G06F 3/067 Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]

Abstract

Techniques and mechanisms provide a storage optimization manager. Data may be optimized and maintained on various nodes in a cluster. Particular nodes may be overburdened while other nodes remain relatively unused. Techniques are provided to efficiently optimize data onto nodes to enhance operational efficiency. Data access requests for optimized data are monitored and managed to allow for intelligent maintenance of optimized data.

Claims

1. A method, comprising:

monitoring data access requests for optimized data maintained on a plurality of nodes in a cluster, wherein the optimized data comprises deduplicated data;

detecting a optimized data storage imbalance;

generating a plurality of new keys associated with a mapping function, the mapping function identifying a particular node corresponding to a particular key;

redistributing optimized data across the plurality of nodes in the cluster.

2. The method of claim 1, wherein each of the plurality of new keys includes a node number.

3. The method of claim 1, wherein the plurality of new keys correspond to a plurality of blockmap files.

4. The method of claim 3, wherein each blockmap file includes offset, length, and location identifiers for identifying segments in a plurality of suitcases.

5. The method of claim 3, wherein the plurality of blockmap files remain unchanged after redistributing optimized data.

6. The method of claim 1, wherein the plurality of new keys are a plurality of suitcase identifiers (scids).

7. The method of claim 6, wherein the mapping function comprises the following:

#define get_the_node_number_from_the_scid(_scid_) scid_to_node_array[_scid_% MAX_CLUSTER_SIZE]

8. The method of claim 1, wherein the data imbalance is a disproportionate rate of data access at a particular node.

9. The method of claim 1, wherein the data imbalance corresponds to overuse of particular nodes and underuse of other nodes.

10. The method of claim 1, wherein a plurality of segments are redistributed across the plurality of nodes.

11. The method of claim 1, wherein the mapping function can be changed while the plurality of new keys are being generated.

12. A system, comprising:

an interface configured to monitor data access requests for optimized data maintained on a plurality of nodes in a cluster, wherein the optimized data comprises deduplicated data;

a processor configured to detect an optimized data storage imbalance and generate a plurality of new keys associated with a mapping function, the mapping function identifying a particular node corresponding to a particular key;

wherein optimized data is redistributed across the plurality of nodes in the cluster.

13. The system of claim 12, wherein the plurality of new keys correspond to a plurality of blockmap files.

14. The system of claim 13, wherein each blockmap file includes offset, length, and location identifiers for identifying segments in a plurality of suitcases.

15. The system of claim 13, wherein the plurality of blockmap files remain unchanged after redistributing optimized data.

16. The system of claim 12, wherein the plurality of new keys are a plurality of suitcase identifiers (scids).

17. The system of claim 16, wherein the mapping function comprises the following:

#define get_the_node_number_from_the_scid(_scid_) scid_to_node_array[_scid_% MAX_CLUSTER_SIZE]

18. The system of claim 12, wherein the data imbalance is a disproportionate rate of data access at a particular node.

19. The system of claim 12, wherein the data imbalance corresponds to overuse of particular nodes and underuse of other nodes.

20. An apparatus, comprising:

means for monitoring data access requests for optimized data maintained on a plurality of nodes in a cluster, wherein the optimized data comprises deduplicated data;

means for detecting a optimized data storage imbalance;

means for generating a plurality of new keys associated with a mapping function, the mapping function identifying a particular node corresponding to a particular key;

means for redistributing optimized data across the plurality of nodes in the cluster.