1. Field of the Invention
The present invention relates to reassigning storage volumes from a failed processing system to a surviving processing system.
2. Description of the Related Art
In certain computing environments, multiple host systems may communicate with one or more control units, such as an IBM Enterprise Storage Server (ESS)®, for data in a storage device managed by the ESS receiving the request. The control unit manages access to storage devices, such as interconnected hard disk drives through one or more logical paths. (IBM and ESS are registered trademarks of IBM). The interconnected drives may be configured as a Direct Access Storage Device (DASD), Redundant Array of Independent Disks (RAID), Just a Bunch of Disks (JBOD), etc.
Typically, the storage systems managed by the control unit includes numerous interconnected hard disk drives from which volumes are configured for the hosts to use. The storage devices may be configured as one or more arrays, such as RAID arrays, and the array storage space then assigned to volumes.
Certain control units include dual processing complexes or systems, each managing access to different sets of logical control units, where each logical control unit is assigned a plurality of storage volumes, such as logical volumes. If one processing complex fails, then the logical control units assigned to the failed processing complex would be reassigned to the surviving processing complex. As part of this failover, the surviving processor sends unit check status to each host for each storage device to which the host is connected to alert them of the failure so that the hosts may redrive any pending Input/Output (I/O) requests. As control units are allowing hosts to connect to ever increasing numbers of storage volumes, the hosts may have to consume substantial computational resources to handle unit checks received as part of a failover to the storage devices (volumes) to which the host is connected.
Provided are a method, system, and program for reassigning storage volumes from a failed processing system to a surviving processing system. A first processing system detects a failure of a second processing system. The first processing system determines device groups of storage devices managed by the failed second processing system and determines for each determined device group, hosts that connect to storage devices in the device group. The first processing system sends, for each device group, a unit check to each determined host indicating failure of each device group through one storage device in the device group to which the determined host connects. The determined hosts execute instructions to terminate any I/O operations in progress on the storage devices in the device group in response to the unit check indicating failure of one storage device in the device group and issue, a command to one storage device for the device group to end the busy condition.
The I/O manager 24a of the surviving processing system 20a reassigns (at block 110) the LCUs managed by the failed second processing system to the surviving first processing system. For each reassigned LCU, a determination is made (at block 112) of the connecting hosts, which may be determined from the connection information entries 50 identifying the reassigned LCU in the field 54 (
In response (at block 120) to receiving a unit check indicating a summary unit check condition from one storage device to which the host 2 connects in a device group (logical control unit 14a, 14b . . . 14n) that failed, the channel subsystem 12 queues (at block 122) any new I/O requests for the set of storage devices (volumes 26a, 26b . . . 26n) in the affected storage device group (logical control unit). The channel subsystem 12 issues (at block 124) a cancel instruction to cancel any start pending I/O operations that have not yet started and that are directed to any devices (volumes 26a, 26b . . . 26n) in the device group (logical control unit 14a, 14b . . . 140n) including the storage device (volume) indicated in the unit check. A clear instruction is further issued (at block 126) to terminate and recover any I/O operations that are active and that are directed to any devices in the device group including the storage device indicated in the unit check. In one embodiment, the operation to recover active I/O operations may involve execution of an error recovery procedure. The cancelled and recovered I/O operations are added (at block 128) to an I/O queue (not shown) in the host memory 6 or channel subsystem 12.
After canceling I/O operations, the channel subsystem 12 issues (at block 130 in
In response to receiving (at block 134) a Reset Summary Unit Check command from a host 2 to a storage device (volume) associated with a given host-LCU pair, the surviving I/O manager 24a resets (at block 136) the summary busy condition 58 for the host-LCU pair. At this point, subsequent new I/O operations may be accepted.
In one embodiment, the operation described herein for aggregating unit checks for a LCU-host pair may be selectively enabled by a given host by issuing a certain command. This allows the storage system to behave appropriately for each host where some hosts have software installed that supports the new mechanism and other hosts may require the old mode of operation.
The described embodiments provide a technique to alert a host of a failure with respect to a device group of storage devices by alerting the host to the failure through one storage device in the device group. In this way, the unit checks for multiple storage devices or volumes are aggregated into a single unit check so as not to overburden the host with unit check signals in systems having thousands of connected devices.
The described embodiments may be implemented as a method, apparatus or article of manufacture using standard programming and/or engineering techniques to produce software, firmware, hardware, or any combination thereof. The term “article of manufacture” as used herein refers to code or logic implemented in hardware logic (e.g., an integrated circuit chip, Programmable Gate Array (PGA), Application Specific Integrated Circuit (ASIC), etc.) or a computer readable medium, such as magnetic storage medium (e.g., hard disk drives, floppy disks, tape, etc.), optical storage (CD-ROMs, optical disks, etc.), volatile and non-volatile memory devices (e.g., EEPROMs, ROMs, PROMs, RAMs, DRAMs, SRAMs, firmware, programmable logic, etc.). Code in the computer readable medium is accessed and executed by a processor. The code in which preferred embodiments are implemented may further be accessible through a transmission media or from a file server over a network. In such cases, the article of manufacture in which the code is implemented may comprise a transmission media, such as a network transmission line, wireless transmission media, signals propagating through space, radio waves, infrared signals, etc. Thus, the “article of manufacture” may comprise the medium in which the code is embodied. Additionally, the “article of manufacture” may comprise a combination of hardware and software components in which the code is embodied, processed, and executed. Of course, those skilled in the art will recognize that many modifications may be made to this configuration without departing from the scope of the present invention, and that the article of manufacture may comprise any information bearing medium known in the art.
In described embodiments, the host creates a connection with a device through a set of connection paths. In one embodiment, the mechanism to create connections between a host and a device is to issue a Set Path Group ID command specifying the establish function to the device through each logical path on which the host wants to establish a connection. These commands associate the connections paths to the device from one host in a path group that has a specified path group ID. In one embodiment each attached host may establish its own path group to a given device, each path group with a unique path group ID.
Certain embodiments may be directed to a method for deploying computing instruction by a person or automated processing integrating computer-readable code into a computing system, wherein the code in combination with the computing system is enabled to perform the operations of the described embodiments.
The illustrated operations of
The foregoing description of various embodiments of the invention has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed. Many modifications and variations are possible in light of the above teaching. It is intended that the scope of the invention be limited not by this detailed description, but rather by the claims appended hereto. The above specification, examples and data provide a complete description of the manufacture and use of the composition of the invention. Since many embodiments of the invention can be made without departing from the spirit and scope of the invention, the invention resides in the claims hereinafter appended.
This patent application is a continuation of U.S. patent application Ser. No. 10/990,038, filed on Nov. 15, 2004, which patent application is incorporated herein by reference in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
5051887 | Berger et al. | Sep 1991 | A |
5455934 | Holland et al. | Oct 1995 | A |
5790775 | Marks et al. | Aug 1998 | A |
5852724 | Glenn, II et al. | Dec 1998 | A |
5922077 | Espy et al. | Jul 1999 | A |
5944838 | Jantz | Aug 1999 | A |
5968182 | Chen et al. | Oct 1999 | A |
5991900 | Garnett | Nov 1999 | A |
6145066 | Atkin | Nov 2000 | A |
6167459 | Beardsley et al. | Dec 2000 | A |
6412078 | Murotani et al. | Jun 2002 | B2 |
6526521 | Lim | Feb 2003 | B1 |
6766470 | Shah | Jul 2004 | B1 |
6769071 | Cheng et al. | Jul 2004 | B1 |
6802021 | Cheng et al. | Oct 2004 | B1 |
6898730 | Hanan | May 2005 | B1 |
6973586 | Petersen et al. | Dec 2005 | B2 |
7058846 | Kelkar et al. | Jun 2006 | B1 |
7076690 | Todd et al. | Jul 2006 | B1 |
7085962 | Hamilton et al. | Aug 2006 | B1 |
7093155 | Aoki | Aug 2006 | B2 |
7111084 | Tan et al. | Sep 2006 | B2 |
7130909 | Yamashita et al. | Oct 2006 | B2 |
7134040 | Ayres | Nov 2006 | B2 |
7139930 | Mashayekhi et al. | Nov 2006 | B2 |
7210068 | Aiello et al. | Apr 2007 | B1 |
7251743 | Chen et al. | Jul 2007 | B2 |
7281154 | Mashayekhi et al. | Oct 2007 | B2 |
7308604 | McDonnell et al. | Dec 2007 | B2 |
7320083 | Davies et al. | Jan 2008 | B2 |
20040098637 | Duncan et al. | May 2004 | A1 |
20040267980 | McBrearty et al. | Dec 2004 | A1 |
Number | Date | Country | |
---|---|---|---|
20080301495 A1 | Dec 2008 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10990038 | Nov 2004 | US |
Child | 12189104 | US |