Priority management of a disk array

• US 20030204687A1
• Filed: 04/24/2002
• Published: 10/30/2003
• Est. Priority Date: 04/24/2002
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Hyde, Joseph Smith II, McNutt, Bruce
• Granted Patent: US 6,839,817 B2
• Time in Patent Office: Days
• US Class Current: 711/158
• 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/0622 in relation to access
• CPC Class Codes: G06F 3/0659 Command handling arrangements, e.g. command buffers, queues, command scheduling
• CPC Class Codes: G06F 3/0689 Disk arrays, e.g. RAID, JBOD

Abstract

In a first form, a method for managing requests in a disk array having a number of disks includes associating priorities with respective requests. A new request is processed, which includes determining a maximum priority for at least certain ones of requests received and comparing the priority of the new request to the maximum priority. Responsive to the comparison, a selection is made between i) categorizing the new request as a foreground disk operation and ii) categorizing the new request as a background disk operation. A selection is also made between i) working the new request on at least one of the disks and ii) placing the new request in a queue.

Claims

1. A method for managing requests in a disk array having a number of disks, the method comprising:

associating priorities with respective requests;

working the requests by the disks;

determining a maximum priority for certain requests received;

comparing the priority of a new request to the priority for the certain requests;

selecting between i) categorizing the new request as a foreground disk operation and ii) categorizing the new request as a background disk operation, responsive to the comparison; and

selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue, responsive to the comparison.

2. The method of claim 1, wherein the requests working on the disks include foreground and background requests, the method comprising associating measures of disk work with respective requests, wherein the selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue is responsive to whether current foreground disk work exceeds a first predetermined limit, if the request is categorized as a foreground request.

3. The method of claim 1, wherein the requests working on the disks include foreground and background requests, the method comprising associating measures of disk work with respective requests, wherein the selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue is responsive to whether current background disk work plus disk work for the new request exceeds a second predetermined limit, if the request is categorized as a background request.

4. The method of claim 3, wherein the selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue is responsive to whether there is current background disk work, if the request is categorized as a background request.

5. The method of claim 1, wherein the selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue is responsive to current disk work, and a request is released from its queue and worked by the disk responsive to the disk work falling below a predetermined limit.

6. The method of claim 1, wherein foreground requests placed in a queue are placed in a first queue, and background requests placed in a queue are placed in a second queue.

7. The method of claim 1, wherein the certain requests received, for which the maximum priority is determined, include requests received during a certain time interval.

8. The method of claim 1, wherein the categorizing for a request occurs only once regardless of subsequent updates to the maximum priority for requests working on the disks.

9. A computer program product for use in managing requests in a disk array having a number of disks, the computer program product comprising computer readable storage media including program logic embedded therein that causes control circuitry to perform:

associating priorities with respective requests;

working the requests by the disks;

determining a maximum priority for certain requests received;

comparing the priority of a new request to the priority for the certain requests;

selecting between i) categorizing the new request as a foreground disk operation, and ii) categorizing the new request as a background disk operation, responsive to the comparison; and

selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue, responsive to the comparison.

10. The computer program product of claim 9, wherein the requests working on the disks include foreground and background requests and wherein the program logic causes control circuitry to perform:

associating measures of disk work with respective requests, and wherein the selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue is responsive to whether the current foreground disk work exceeds a first predetermined limit, if the request is categorized as a foreground request.

11. The computer program product of claim 9, wherein the requests working on the disks include foreground and background requests and wherein the program logic causes control circuitry to perform:

associating measures of disk work with respective requests, wherein the selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue is responsive to whether the current background disk work plus the disk work for the new request exceeds a second predetermined limit, if the request is categorized as a background request.

12. The computer program product of claim 11, wherein the selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue is responsive to whether there is current background disk work, if the request is categorized as a background request.

13. The computer program product of claim 9, wherein the selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue is responsive to current disk work, and wherein the sixth instructions include instructions for releasing a request from its queue for working by the disk responsive to the disk work falling below a predetermined limit.

14. The computer program product of claim 9, wherein foreground requests placed in a queue are placed in a first queue and background requests placed in a queue are placed in a second queue.

15. The computer program product of claim 9, wherein the certain requests received, for which the maximum priority is determined, include requests received during a certain time interval.

16. The computer program product of claim 9, wherein the categorizing for a request occurs only once regardless of subsequent updates to the maximum priority for requests working on the disks.

17. An apparatus comprising:

a processor;

a disk array having a number of disks and at least one queue, the at least one queue being external to the disks; and

a memory having instructions operable with the processor for managing requests in the disk array to perform;

associating priorities with respective requests;

working the requests by the disks;

determining a maximum priority for certain requests received;

comparing the priority of a new request to the priority for the certain requests;

selecting between i) categorizing the new request as a foreground disk operation and ii) categorizing the new request as a background disk operation, responsive to the comparison; and

selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue, responsive to the comparison.

18. The apparatus of claim 17, wherein the requests working on the disks include foreground and background requests, and the processor is operable with the instructions to associate measures of disk work with respective requests, and wherein the selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue is responsive to whether the current foreground disk work exceeds a first predetermined limit, if the request is categorized as a foreground request.

19. The apparatus of claim 17, wherein the requests working on the disks include foreground and background requests, and the processor is operable with the instructions to associate measures of disk work with respective requests, and wherein the selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue is responsive to whether the current background disk work plus the disk work for the new request exceeds a second predetermined limit, if the request is categorized as a background request.

20. The apparatus of claim 19, wherein the selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue is responsive to whether there is current background disk work, if the request is categorized as a background request.

21. The apparatus of claim 17, wherein the selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue is responsive to current disk work, and a request is released from its queue and worked by the disk responsive to the disk work falling below a predetermined limit.

22. The apparatus of claim 17, wherein foreground requests placed in a queue are placed in a first queue and background requests placed in a queue are placed in a second queue.

23. The apparatus of claim 17, wherein the certain requests received, for which the maximum priority is determined, include requests received during a certain time interval.

24. The apparatus of claim 17, wherein the categorizing for a request occurs only once regardless of subsequent updates to the maximum priority for requests working on the disks.

25. An storage controller comprising:

means for associating priorities with respective requests for a disk array, wherein the disk array has a number of disks;

means for sending the requests for working by the disks;

means for determining a maximum priority for certain requests received;

means for comparing the priority of a new request to the priority for the certain requests;

means for selecting between i) categorizing the new request as a foreground disk operation and ii) categorizing the new request as a background disk operation, responsive to the comparison; and

means for selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue external to the disks, responsive to the comparison.

26. The storage controller of claim 25, wherein the requests working on the disks include foreground and background requests, and the storage controller is operable to associate measures of disk work with respective requests, and wherein the means for selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue is responsive to whether the current foreground disk work exceeds a first predetermined limit, if the request is categorized as a foreground request.

27. The storage controller of claim 25, wherein the requests working on the disks include foreground and background requests, and the storage controller is operable to associate measures of disk work with respective requests, and wherein the means for selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue is responsive to whether the current background disk work plus the disk work for the new request exceeds a second predetermined limit, if the request is categorized as a background request.

28. The storage controller of claim 27, wherein the means for selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue is responsive to whether there is current background disk work, if the request is categorized as a background request.

29. The storage controller of claim 25, wherein the means for selecting between i) working the new request on at least one of the disks and ii) placing the new request in a queue is responsive to current disk work, and the storage controller comprises:

means for releasing a request from its queue responsive to the disk work falling below a predetermined limit.

30. The storage controller of claim 25, wherein foreground requests placed in a queue are placed in a first queue and background requests placed in a queue are placed in a second queue.

31. The storage controller of claim 25, wherein the certain requests received, for which the maximum priority is determined, include requests received during a certain time interval.

32. The storage controller of claim 25, wherein the categorizing for a request occurs only once regardless of subsequent updates to the maximum priority for requests working on the disks.