Method for configurable priority read order of mirrors from within a volume manager

• US 20030236954A1
• Filed: 06/20/2002
• Published: 12/25/2003
• Est. Priority Date: 06/20/2002
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Keohane, Susann Marie, McBrearty, Gerald Francis, Shieh, Johnny Meng-Han, Murillo, Jessica Kelley, Mullen, Shawn Patrick
• Application Number:
  US10/177,846
• Publication Number:
  US 20030236954A1
• 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

Abstract

A method, program, and system for prioritizing data read operations are provided. The invention comprises prioritizing a plurality of storage drives that contain duplicate data, and, responsive to a read request, reading data from the highest priority storage drive among the plurality of storage drives. If the highest priority drive is unavailable, or if the read operation is unsuccessful, data is read from the next highest priority drive that is available. The drive can be distributed over a network, with priority determined according to proximity to a given user.

Claims

1. A method for prioritizing data read operations, the method comprising the computer-implemented steps of:

prioritizing a plurality of storage drives that contain duplicate data; and

responsive to a read request, reading data from the highest priority storage drive among the plurality of storage drives.

2. The method according to claim 1, wherein the data is organized into logical volumes by a logical volume manager.

3. The method according to claim 1, further comprising:

if the highest priority storage drive is unavailable, reading data from the next highest priority storage drive available among the plurality of storage drives.

4. The method according to claim 1, further comprising:

if data read from the highest priority storage drive is unsuccessful, reading data from the next highest priority storage drive available among the plurality of storage drives.

5. The method according to claim 1, wherein the plurality of storage drives comprise a logical volume group.

6. The method according to claim 1, wherein the plurality of storage drives comprise a redundant array of independent disk (RAID).

7. The method according to claim 1, wherein the plurality of storage drives are distributed over a computer network.

8. The method according to claim 7, wherein the plurality of storage drives are prioritized according to proximity to a given user.

9. A computer program product in a computer readable medium for use in a data processing system, for prioritizing data read operations, the computer program product comprising:

first instructions for prioritizing a plurality of storage drives that contain duplicate data; and

second instructions, responsive to a read request, for reading data from the highest priority storage drive among the plurality of storage drives.

10. The computer program product according to claim 9, wherein the data is organized into logical volumes by a logical volume manager.

11. The computer program product according to claim 9, further comprising:

third instructions, if the highest priority storage drive is unavailable, for reading data from the next highest priority storage drive available among the plurality of storage drives.

12. The computer program product according to claim 9, further comprising:

fourth instructions, if data cannot be read successfully from the highest priority storage drive, for reading data from the next highest priority storage drive available among the plurality of storage drives.

13. The computer program product according to claim 9, wherein the plurality of storage drives comprise a logical volume group.

14. The computer program product according to claim 9, wherein the plurality of storage drive are distributed over a computer network.

15. The computer program product according to claim 14, wherein the plurality of storage drives are prioritized according to proximity to a given user.

16. A system for prioritizing data read operations, the system comprising:

a ranking component for prioritizing a plurality of storage drives that contain duplicate data; and

a data recovery component, responsive to a read request, for reading data from the highest priority storage drive among the plurality of storage drives.

17. The system according to claim 16, wherein the data is organized into logical volumes by a logical volume manager.

18. The system according to claim 16, further comprising:

a second data recover component, if the highest priority storage drive is unavailable, for reading data from the next highest priority storage drive available among the plurality of storage drives.

19. The system according to claim 16, further comprising:

a third data recovery component, if data cannot be read successfully from the highest priority storage drive, for reading data from the next highest priority storage drive available among the plurality of storage drives.

20. The system according to claim 16, wherein the plurality of storage drives comprise a logical volume group.

21. The system according to claim 16, wherein the plurality of storage drives comprise a redundant array of independent disk (RAID).

22. The system according to claim 16, wherein the plurality of storage drive are distributed over a computer network.

23. The system according to claim 22, wherein the plurality of storage drive are prioritized according to proximity to a given user.