Managing storage contention in automated storage systems

• US 6,684,313 B2
• Filed: 08/15/2001
• Issued: 01/27/2004
• Est. Priority Date: 08/15/2001
• Status: Expired due to Term

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Voigt, Douglas L., Olsen, Bruce A
• Primary Examiner(s): Padmanabhan, Mano
• Assistant Examiner(s): Namazi, Mehdi
• Application Number:
  US09/931,081
• Publication Number:
  US 20030037214A1
• Time in Patent Office: 895 Days
• Field of Search: 711/112, 711/114, 711/170, 711/202, 711/209, 709/105, 707/7
• US Class Current: 711/170
• CPC Class Codes: G06F 2003/0697 device management, e.g. handlers, drivers, I/O schedulers
• CPC Class Codes: G06F 3/0601 Interfaces specially adapted for storage systems
• CPC Class Codes: G06F 3/0619 in relation to data integrity, e.g. data losses, bit errors
• CPC Class Codes: G06F 3/064 Management of blocks
• CPC Class Codes: G06F 3/0689 Disk arrays, e.g. RAID, JBOD
• CPC Class Codes: Y10S 707/99937 Sorting

Abstract

An automated process of assigning storage resources to logical units (“LU'"'"'s”) is informed of contention avoidance, in order to yield reduced contention. LU'"'"'s are defined and assigned to logical groups. Then a process having automatic aspects assigns physical storage resources to the LU'"'"'s responsive to the LU logical groupings. In another aspect, the assignment of physical storage resources is responsive to the logical groups in a manner such that the LU'"'"'s in one logical group cannot contend for physical storage resources with the LU'"'"'s in another group, but the LU'"'"'s in a single group may contend with one another. In lieu of LU'"'"'s being manually assigned to logical groups, certain contention avoidance relations among the LU'"'"'s are defined and then an automated process assigns the LU'"'"'s to logical groups responsive to the contention avoidance relations.

Claims

1. A method for managing storage contention in an automated storage system, the method comprising the steps of:

a) assigning logical storage units (“

LU'"'"'s”

) to logical groups, wherein some of the LU'"'"'s are grouped together as a first logical group, and others of the LU'"'"'s are grouped together as a second logical group; and

b) “

assigning physical storage resources responsive to the LU logical groupings, wherein the physical storage resources assigned to the LU'"'"'s in the first logical group are independent of the physical storage resources assigned to the LU'"'"'s in the second logic group, so that the LU'"'"'s in the first logical group cannot contend for physical storage resources with the LU'"'"'s in the second logical group;

c) wherein step a) comprises assigning one of the LU'"'"'s to a third logical group, and automatically assigning the LU'"'"'s to the logical groups responsive to predetermined contention avoidance relations among the LU'"'"'s, and step b) comprises assigning the LU'"'"'s in the third logical group to physical storage resources that are independent of the storage resources assigned to the LU'"'"'s in the first and second logical groups.

2. The method of claim 1 wherein step b) comprises assigning physical storage resources to the LU'"'"'s such that the LU'"'"'s within the first logical group are capable of contending with one another for the physical storage resources, and the LU'"'"'s within the second logical group are capable of contending with one another for the physical resources.

3. The method of claim 1, wherein step b) comprises assigning the physical storage resources to physical groups, and assigning a first one of the physical groups to the first LU logical group and a second one of the physical groups to the second LU logical group, so that there is a one-to-one correspondence of physical groups and logical groups.

4. The method of claim 1, wherein the assigning in step a) comprises manually assigning LU'"'"'s to logical groups, and wherein any LU'"'"'s not manually assigned to logical groups are automatically assigned as a default logical group, and wherein step b) comprises assigning the physical storage resources to the LU'"'"'s such that the LU'"'"'s in the default logical group are assigned to physical storage resources that are independent of the storage resources assigned to the LU'"'"'s in the first and second logic groups, so that the LU'"'"'s in the default logical group cannot contend for physical storage resources with the LU'"'"'s in the first and second logical groups.

5. The method of claim 1, wherein the contention avoidance relations include contention avoidance values for respective pairs of LU'"'"'s.

6. The method of claim 5, wherein automatically assigning the LU'"'"'s to the logical groups responsive to predetermined contention avoidance relations among the LU'"'"'s comprises assigning one of the LU'"'"'s to a logical group responsive to the LU'"'"'s contention avoidance values with respect to other LU'"'"'s already assigned to the logical group.

7. The method of claim 1, wherein the automatic assigning of LU'"'"'s to logical groups comprises assigning a first one of the LU'"'"'s to a logical group at a first time, then a next one of the LU'"'"'s at a next time, so that during the assigning of LU'"'"'s to logical groups the size of a logical group grows as more LU'"'"'s are assigned to the logical group, and wherein each LU is assigned, at the time of its respective assignment, to a logical group that is largest among those logical groups having solely LU'"'"'s compatible with the contention avoidance value for the LU that is being assigned at the time.

8. An apparatus for managing storage contention in an automated storage system, the apparatus comprising:

a processor coupled to a storage device, wherein the storage device is for storing a program for controlling the processor, and wherein the processor is operative with the storage device to execute the program for performing the steps of;

a) assigning logical storage units (“

LU'"'"'s”

) to logical groups, wherein some of the LU'"'"'s are grouped together as a first logical group, and others of the LU'"'"'s are grouped together as a second logical group; and

b) assigning physical storage resources responsive to the LU logical groupings, wherein the physical storage resources assigned to the LU'"'"'s in the first logical group are independent of the physical storage resources assigned to the LU'"'"'s in the second logic group, so that the LU'"'"'s in the first logical group cannot contend for physical storage resources with the LU'"'"'s in the second logical group;

c) wherein step a) comprises automatically assigning the LU'"'"'s to the logical groups responsive to predetermined contention avoidance relations among the LU'"'"'s.

9. The apparatus of claim 8, wherein the contention avoidance relations include contention avoidance values for respective pairs of LU'"'"'s.

10. The apparatus of claim 9, wherein automatically assigning the LU'"'"'s to the logical groups responsive to predetermined contention avoidance relations among the LU'"'"'s comprises assigning one of the LU'"'"'s to a logical group responsive to the LU'"'"'s contention avoidance values with respect to other LU'"'"'s already assigned to the logical group.

11. The apparatus of claim 8, wherein the automatic assigning of LU'"'"'s to logical groups comprises assigning a first one of the LU'"'"'s to a logical group at a first time, then a next one of the LU'"'"'s at a next time, so that during the assigning of LU'"'"'s to logical groups the size of a logical group grows as more LU'"'"'s are assigned to the logical group, and wherein each LU is assigned, at the time of its respective assignment, to a logical group that is largest among those logical groups having solely LU'"'"'s compatible with the contention avoidance value for the LU that is being assigned at the time.

12. A computer program product for managing storage contention in an automated storage system, the computer program product comprising:

a) instructions for assigning logical storage units (“

LU'"'"'s”

) to logical groups, wherein some of the LU'"'"'s are grouped together as a first logical group, and others of the LU'"'"'s are grouped together as a second logical group; and

b) instructions for assigning physical storage resources responsive to the LU logical groupings, wherein the physical storage resources assigned to the LU'"'"'s in the first logical group are independent of the physical storage resources assigned to the LU'"'"'s in the second logic group, so that the LU'"'"'s in the first logical group cannot contend for physical storage resources with the LU'"'"'s in the second logical group;

c) wherein a) comprises instructions for automatically assigning the LU'"'"'s to the logical groups responsive to predetermined contention avoidance relations among the LU'"'"'s.

13. The computer program product of claim 12, wherein the contention avoidance relations include contention avoidance values for respective pairs of LU'"'"'s.

14. The computer program product of claim 13, wherein automatically assigning the LU'"'"'s to the logical groups responsive to predetermined contention avoidance relations among the LU'"'"'s comprises assigning one of the LU'"'"'s to a logical group responsive to the LU'"'"'s contention avoidance values with respect to other LU'"'"'s already assigned to the logical group.

15. The computer program product of claim 13, wherein the automatic assigning of LU'"'"'s to logical groups comprises assigning a first one of the LU'"'"'s to a logical group at a first time, then a next one of the LU'"'"'s at a next time, so that during the assigning of LU'"'"'s to logical groups the size of a logical group grows as more LU'"'"'s are assigned to the logical group, and wherein each LU is assigned, at the time of its respective assignment, to a logical group that is largest among those logical groups having solely LU'"'"'s compatible with the contention avoidance value for the LU that is being assigned at the time.

16. The computer program product of claim 13, wherein b) comprises instructions for assigning physical storage resources to the LU'"'"'s such that the LU'"'"'s within the first logical group are capable of contending with one another for the physical storage resources, and the LU'"'"'s within the second logical group are capable of contending with one another for the physical storage resources.