Method and system for capacity-balancing cells of a storage system
View Patent ↗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.
1. 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.
2. The system 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.
3. The system of claim 1 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.
4. The system of claim 1 wherein the another one of the plurality of cells comprises an empty cell.
5. The system of claim 1 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.
6. 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.
7. 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.
8. The method of claim 1 wherein the size of the fragmented portion is based on the number of the plurality of cells.
9. The method of claim 8 wherein the size of the fragmented portion is based on a reciprocal of the number of the plurality of cells.
10. 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.
11. 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.
12. The method of claim 1 wherein the another one of the plurality of cells comprises an empty cell.
13. The method of claim 1 wherein the another one of the plurality of cells comprises a non-empty cell.
14. The method of claim 1 further comprising determining a number of objects to be moved from the one of the plurality of cells.
15. The method of claim 14 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.
16. 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.
17. The method of claim 16 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.
18. The method of claim 16 wherein the number of objects to be moved is based on one less than the number of the plurality of cells.
19. The method of claim 16 wherein the another one of the plurality of cells comprises an empty cell.
20. The method of claim 16 wherein the another one of the plurality of cells comprises a non-empty cell.