# US 2009/0276598 A1 · Method and system for capacity-balancing cells of a storage system

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

- Number: US 2009/0276598 A1
- Document ID: US20090276598A1
- Status: Published application
- Kind: A1
- Application number: 12/113,269
- Filed: 2008-05-01
- Published: 2009-11-05
- Earliest claimed: 2008-05-01
- Assignees: Oracle America, Inc.
- Inventors: Stephane Brossier; Sacha Christophe Arnoud; Shamim P. Mohamed
- Web page: https://patentgrep.com/patent/US20090276598A1

## CPC

- H04L 67/1097: 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]
- G06F 11/1008: {in individual solid state devices (G06F11/1004 takes precedence)}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A plurality of cells forming at least a portion of a hive of a data storage system may be capacity balanced by fragmenting a portion of at least one non-empty tile of one of the plurality of cells and moving the fragmented portion to another one of the plurality of cells. A plurality of cells forming at least a portion of a hive of a fixed content storage system may be capacity balanced by identifying at least one of the plurality of cells from which objects are to be moved, and for each of the at least one of the plurality of cells identified, determining a number of objects to be moved to another one of the plurality of cells, identifying one or more tiles that collectively have approximately the number of objects to be moved, and moving the one or more tiles to the another one of the plurality of cells.

## Claims

### Claim 1

A method of capacity balancing a plurality of cells forming at least a portion of a hive of a data storage system, each of the plurality of cells including at least one tile having a size defined by a range of proxy object identification values, the method comprising:
fragmenting a portion of at least one non-empty tile of one of the plurality of cells; and
moving the fragmented portion to another one of the plurality of cells thereby capacity balancing the plurality of cells.

### Claim 2 (depends on 1)

The method of claim 1 wherein a plurality of objects are approximately evenly distributed along the range of proxy object identification values of the at least one non-empty tile.

### Claim 3 (depends on 1)

The method of claim 1 wherein the size of the fragmented portion is based on the number of the plurality of cells.

### Claim 4 (depends on 3)

The method of claim 3 wherein the size of the fragmented portion is based on a reciprocal of the number of the plurality of cells.

### Claim 5 (depends on 1)

The method of claim 1 wherein the size of the fragmented portion is based on a reciprocal of one less than the number of the plurality of cells.

### Claim 6 (depends on 1)

The method of claim 1, wherein the fragmented portion includes an object residing at one of the range of proxy object identification values, further comprising locating the object based on its proxy object identification value.

### Claim 7 (depends on 1)

The method of claim 1 wherein the another one of the plurality of cells comprises an empty cell.

### Claim 8 (depends on 1)

The method of claim 1 wherein the another one of the plurality of cells comprises a non-empty cell.

### Claim 9 (depends on 1)

The method of claim 1 further comprising determining a number of objects to be moved from the one of the plurality of cells.

### Claim 10 (depends on 9)

The method of claim 9 wherein the size of the fragmented portion is based on the number of objects to be moved from the one of the plurality of cells.

### Claim 11

A method of capacity balancing a plurality of cells forming at least a portion of a hive of a fixed content storage system, each of the plurality of cells comprising at least one tile having a size defined by a range of proxy object identification values, at least one of the tiles having a plurality of objects residing at respective proxy object identification values, the method comprising:
identifying at least one of the plurality of cells from which objects are to be moved; and
for each of the at least one of the plurality of cells identified
(i) determining a number of objects to be moved to another one of the plurality of cells,
(ii) identifying one or more tiles that collectively have approximately the number of objects to be moved, and
(iii) moving the one or more tiles to the another one of the plurality of cells.

### Claim 12 (depends on 11)

The method of claim 11 wherein the number of objects to be moved is based on a total number of objects residing on the at least one of the plurality of cells identified.

### Claim 13 (depends on 11)

The method of claim 11 wherein the number of objects to be moved is based on one less than the number of the plurality of cells.

### Claim 14 (depends on 11)

The method of claim 11 wherein the another one of the plurality of cells comprises an empty cell.

### Claim 15 (depends on 11)

The method of claim 11 wherein the another one of the plurality of cells comprises a non-empty cell.

### Claim 16

A system for capacity balancing a plurality of cells forming at least a portion of a hive of a data storage system, each of the plurality of cells comprising at least one tile having a size defined by a range of proxy object identification values, the system comprising:
one or more processing units operatively arranged and configured to fragment a portion of at least one non-empty tile from one of the plurality of cells and to move the fragmented portion to another one of the plurality of cells thereby capacity balancing the plurality of cells.

### Claim 17 (depends on 16)

The system of claim 16 wherein a plurality of objects are approximately evenly distributed along the range of proxy object identification values of the at least one non-empty tile.

### Claim 18 (depends on 16)

The system of claim 16 wherein the fragmented portion includes an object residing at one of the range of proxy object identification values and wherein the one or more processing units are further operatively arranged and configured to locate the object based on its proxy object identification value.

### Claim 19 (depends on 16)

The system of claim 16 wherein the another one of the plurality of cells comprises an empty cell.

### Claim 20 (depends on 16)

The system of claim 16 wherein the one or more processing units are further operatively arranged and configured to determine a number of objects to be moved from the one of the plurality of cells.
