Data storage apparatus and method allocating sets of data

• US 5,943,690 A
• Filed: 04/07/1997
• Issued: 08/24/1999
• Est. Priority Date: 04/07/1997
• Status: Expired due to Fees

• Current Assignee: Sony Corporation (Sony Group Corp.), Sony United Kingdom Limited (Sony Group Corp.)
• Original Assignee: Sony Corporation (Sony Group Corp.), Sony United Kingdom Limited (Sony Group Corp.)
• Inventors: Dorricott, Martin Rex, Cox, Penelope Susan, Shepherd, David Colin Charles
• Primary Examiner(s): Cabeca, John W.
• Assistant Examiner(s): Namazi, Mehdi
• Application Number:
  US08/826,656
• Time in Patent Office: 869 Days
• Field of Search: 707/205, 711/113, 711/153, 711/206, 711/209, 711/148, 711/171, 711/172
• US Class Current: 711/171
• CPC Class Codes: G06F 3/0608 Saving storage space on storage systems
• CPC Class Codes: G06F 3/0644 Management of space entities, e.g. partitions, extents, pools
• CPC Class Codes: G06F 3/0689 Disk arrays, e.g. RAID, JBOD
• CPC Class Codes: Y10S 707/99953 Recoverability
• CPC Class Codes: Y10S 707/99956 File allocation

Abstract

A data storage apparatus has a plurality of storage spaces p for storing sets of data. Each of the spaces has: available (unused) space x₁ for storage; a number x₂ of data sets already stored; a number x₃ of channels available for transferring data to the space; and a number x₄ of times the space is scheduled to be used for reading out sets of data therefrom. An allocation factor Qp=f(ai, xi) is calculated for each space where ai are weighting factors ranking xi in order of importance. A data set is allocated to the space having the "best " (e.g. lowest) value of Qp at the time the data is to be allocated. Once allocation factors determined, then data may be allocated according to usage indices representing the ability of a space to store the data at the time of allocation.

Claims

1. A data storage apparatus comprising:

a plurality of data storage spaces p for storing sets of data; and

allocation means for allocating the sets of data to the data storage spaces p, the allocation means determining for each data storage space p an allocation factor Qp=Σ

f(ai,xi);

where the xi(i=1 to n) are a predetermined set of variables which influence the ability of a data storage space p to store a data set at the time the set is to be allocated to the space and to allow the data set to be read out, and

ai are weighting factors for weighting the variables according to a predetermined ranking of the relative importance of the variables,

the allocation factor Qp of the data storage spaces being compared with each other and the data being allocated to a data storage space p in dependence upon the comparison.

2. Apparatus according to claim 1, wherein

3. Apparatus according to claim 1, wherein

4. Apparatus according to claim 1, wherein one of the variables, x₁, is a measure of the amount of available space in a data storage space p.

5. Apparatus according to claim 1 wherein one of the variables, x₂, is a measure of the number of data sets stored in a data storage space p.

6. Apparatus according to claim 1 where each data storage space p has a plurality of data transfer channels and one of the variables, x₃, is a measure of the number of active channels available at the time data is to be allocated to that space.

7. Apparatus according to claim 1 wherein one of the variables, x₄ is a measure of the number of times a data storage space p is scheduled for transfer of sets of data.

8. Apparatus according to claim 1 wherein the variables xi are normalized.

9. Apparatus according to claim 8 wherein the variables xi are normalized to a maximum value of one.

10. Apparatus according to claim 4, wherein x₁ is the amount of available space in a data storage space p in relation to the total space available on all data storage p spaces.

11. Apparatus according to claim 5 wherein x₂ is the number of files in a data storage space p in relation to the total number of files in all the data storage spaces p.

12. Apparatus according to claim 6, wherein x₃ is the number of data transfer channels of a data storage space p in relation to the total number of data transfer channels of all data storage spaces p.

13. Apparatus according to claim 7 wherein x₄ is the number of scheduled transfers to/from a data storage space p in relation to the total number of scheduled transfers to/from all data storage spaces p.

14. Apparatus according to claim 1, wherein the allocation means, in addition to allocating data sets to the data storage spaces p in accordance with said allocation factors Qp, allocates the data sets in accordance with at least one other criterion.

15. Apparatus according to claim 14, wherein the allocation means compares the size of a data set to be allocated to the sizes of the available data storage space p, and in preference to allocating the data set in accordance with Qp, allocates the data set to one of the data storage spaces p if the data set substantially fills the available space on that one of the data storage spaces p.

16. A method of allocating sets of data amongst data storage spaces p, the method comprising the steps of:

providing said p data storage spaces; and

determining for each data storage space p an allocation factor Qp where Qp=Σ

f(ai,xi)

where the xi(i=1 to n) are a predetermined set of variables which influence the ability of a space p to store a data set at the time the set is to be allocated to the space and to allow the data set to be read out, and

ai are weighting factors for weighting the variables according to a predetermined ranking of the relative importance of the variables,

the allocation factor Qp of the data storage spaces being compared with each other and the data being allocated to a data storage space p in dependence upon the comparison.

17. The method according to claim 16, wherein the step of determining determines said allocation factor Qp=Σ

ai(xi)² such that the sets of data are allocated to the data storage spaces p having the lowest value of Qp.

18. The method according to claim 16, wherein said step of determining determines said allocation factor Qp=Σ

ai|xi| such that the sets of data are allocated to the data storage spaces having the lowest value of Qp.

19. The method according to claim 16, wherein the step of determining determines said allocation factor Qp in accordance with the variable x₁ indicative of the measure of the amount of available space in a data storage space p.

20. The method according to claim 16, wherein said step of determining determines said allocation factor Qp according to the variable x₂ indicative of a measure of the number of data sets stored in a data storage space p.

21. The method according to claim 16, wherein the step of determining determines the allocation factor Qp according to the variable x₃ indicative of a measure of the number of active channels available at the time the data is to be allocated to that space.

22. The method according to claim 16, wherein the step of determining determines the allocation factor Qp according to the variable x₄ indicative of a measure of the number of times a data storage space p is scheduled for transferring sets of data.

23. The method according to claim 16, further comprising the step of normalizing said variables xi.

24. The method according to claim 23, wherein the step of normalizing normalizes said variables xi to a maximum value of 1.

25. The method according to claim 19, wherein x₁ is the amount of available space in a data storage space p in relation to the total space available on all data storage spaces p.

26. The method according to claim 20, wherein x₂ is the number of files in a data storage space p in relation to the number of files in all the data storage spaces p.

27. The method according to claim 21, wherein X₃ is the number of data transfer channels of a data storage space p in relation to the total number of data transfer channels of all data storage spaces p.

28. The method according to claim 22, wherein x₄ is the number of scheduled transfers to/from a data storage space p in relation to the total number of scheduled transfers to/from all data storage spaces p.

29. The method according to claim 16, wherein said step of determining, in addition to allocating data sets to the data storage spaces p in accordance with said allocation factor Qp, allocates the data sets in accordance with at least one other criterion.

30. The method according to claim 29, wherein the step of determining compares the size of a data set to be allocated to the sizes of the available data storage space p, and in preference to allocating the data set in accordance with Qp, allocates the data set to one of the data storage spaces p if the data set substantially fills the available space on that one of the data storage spaces p.