# US 2012/0084270 A1 · Storage optimization manager

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2012/0084270 A1
- Document ID: US20120084270A1
- Status: Published application
- Kind: A1
- Application number: 13/158,292
- Filed: 2011-06-10
- Published: 2012-04-05
- Earliest claimed: 2010-10-04
- Assignees: Dell Products L.P.
- Inventors: Vinod Jayaraman; Abhijit Dinkar; Mark Taylor; Goutham Rao; Michael E. Root; Murali Bashyam
- Web page: https://patentgrep.com/patent/US20120084270A1

## CPC

- G06F 3/0604: {Improving or facilitating administration, e.g. storage management}
- G06F 3/0608: {Saving storage space on storage systems}
- G06F 3/0641: {De-duplication techniques}
- G06F 3/0643: {Management of files}
- G06F 3/0647: {Migration mechanisms}
- G06F 3/0667: {at data level, e.g. file, record or object virtualisation}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- 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)}
- G06F 16/182: Distributed file systems
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## 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

### Claim 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.

### Claim 2 (depends on 1)

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

### Claim 3 (depends on 1)

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

### Claim 4 (depends on 3)

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

### Claim 5 (depends on 3)

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

### Claim 6 (depends on 1)

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

### Claim 7 (depends on 6)

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]

### Claim 8 (depends on 1)

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

### Claim 9 (depends on 1)

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

### Claim 10 (depends on 1)

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

### Claim 11 (depends on 1)

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

### Claim 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.

### Claim 13 (depends on 12)

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

### Claim 14 (depends on 13)

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

### Claim 15 (depends on 13)

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

### Claim 16 (depends on 12)

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

### Claim 17 (depends on 16)

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]

### Claim 18 (depends on 12)

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

### Claim 19 (depends on 12)

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

### Claim 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.
