Abstract:
Input/output (I/O) I/O target selection is achieved within a data storage system having clustered nodes of initiators, I/O targets, and grouped storage logical units. A state definition component defines access states for each combination of one or more combinations of a node, an I/O target, and a storage logical unit. A profiler component produces an access state profile for each I/O target. A rank criteria compiler compiles rank criteria as a basis for best-fit identification of I/O targets for a logical unit (LU) group. A best-fit identifier is responsive to the profile component and the rank criteria compiler and identifies a ranked best-fit order of I/O targets for an LU group. A target selector selects an I/O target for an LU group from the ranked best-fit order.

Description:
RELATED PATENT APPLICATIONS 
       [0001]    The present patent application claims priority under 35 USC 119 to the previously filed and presently pending United Kingdom patent application entitled “Apparatus and method for storage cluster control,” filed on Aug. 16, 2007, and assigned application no. 07114456.2. 
       FIELD OF THE INVENTION 
       [0002]    The present invention relates to improving control of clustered nodes in storage subsystems. 
       BACKGROUND OF THE INVENTION 
       [0003]    In a storage system (such as a Storage Area Network or SAN) there can be clustered node host entities (such as a SAN Volume Controller or SVC) each with multiple I/O initiators that submit I/O. There can also be storage subsystems with multiple I/O targets that export Logical Unit (hereinafter referred to as LU) resources that service I/O requests made by the initiators. 
         [0004]    It is known in the art to have a mechanism for coordinating LU access to prevent the performance impacts of accessing the same LU through multiple targets (known as LU thrashing). This technique requires the clustered nodes to communicate with each other to select a single target that all clustered node I/O requests for a single LU are submitted to. 
         [0005]    However, in clustered arrangements having grouped storage LUs, there remain significant problems when asymmetric error conditions cause performance impacts on I/O activity. 
       SUMMARY OF THE INVENTION 
       [0006]    The present invention relates to an apparatus and a method for storage cluster control. An apparatus of one embodiment of the invention is for input/output (I/O) target selection within a data storage system having clustered nodes of initiators, I/O targets, and grouped storage logical units. The apparatus includes a state definition component, a profiler component, a rank criteria compiler, a best-fit identifier, and a target selector. The state definition component is to define access states for each combination of one or more combinations of a node, an I/O target, and a storage logical unit. The profiler component is to produce an access state profile for each I/O target. The rank criteria compiler is to compile rank criteria as a basis for best-fit identification of I/O targets for a logical unit (LU) group. The best-fit identifier is responsive to the profile component and the rank criteria compiler to identify a ranked best-fit order of I/O targets for an LU group. The target selector is to select an I/O target for an LU group from the ranked best-fit order. 
         [0007]    An apparatus of another embodiment of the invention is also for I/O target selection within a data storage system having clustered nodes of initiators, I/O targets, and grouped storage logical units. The apparatus includes first means for defining access states for each combination of one or more combinations of a node, an I/O target, and a storage logical unit. The apparatus includes second means for producing an access state profile for each I/O target. The apparatus includes third means for compiling rank criteria as a basis for best-fit identification of I/O targets for a logical unit (LU) group. The apparatus includes fourth means for identifying a ranked best-fit order of I/O targets for an LU group. The apparatus includes fifth means for selecting an I/O target for an LU group from the ranked best-fit order. 
         [0008]    A method of an embodiment of the invention is for input/output (I/O) target selection within a data storage system having clustered nodes of initiators, I/O targets, and grouped storage logical units. The method defines access states for each combination of one or more combinations of a node, an I/O target, and a storage logical unit. The method produces an access state profile for each I/O target. The method compiles rank criteria as a basis for best-fit identification of I/O targets for an LU group. The method identifies a ranked best-fit order of I/O targets for an LU group. The method selects an I/O target for an LU group from said ranked best-fit order. 
         [0009]    An article of manufacture of an embodiment of the invention has a computer program stored thereon to perform a method. The article of manufacture may be or include a tangible computer-readable medium, such as a recordable data storage medium. The computer program may be executed by one or more processors of one or more computing devices. The method performed by the computer program is for input/output (I/O) target selection within a data storage system having clustered nodes of initiators, I/O targets, and grouped storage logical units. The method defines access states for each combination of one or more combinations of a node, an I/O target, and a storage logical unit. The method produces an access state profile for each I/O target. The method compiles rank criteria as a basis for best-fit identification of I/O targets for an LU group. The method identifies a ranked best-fit order of I/O targets for an LU group. The method selects an I/O target for an LU group from said ranked best-fit order. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0010]    The drawings referenced herein form a part of the specification. Features shown in the drawing are meant as illustrative of only some embodiments of the invention, and not of all embodiments of the invention, unless otherwise explicitly indicated, and implications to the contrary are otherwise not to be made. 
           [0011]      FIG. 1  shows in schematic form an arrangement of apparatus in accordance with an embodiment of the present invention. 
           [0012]      FIG. 2  shows in schematic form an apparatus or arrangement of apparatus in accordance with an embodiment of the present invention. 
           [0013]      FIG. 3  shows in flowchart form one method or logic arrangement in which an embodiment of the present invention may be implemented. 
       
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
       [0014]    In the following detailed description of exemplary embodiments of the invention, reference is made to the accompanying drawings that form a part hereof, and in which is shown by way of illustration specific exemplary embodiments in which the invention may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice the invention. Other embodiments may be utilized, and logical, mechanical, and other changes may be made without departing from the spirit or scope of the present invention. The following detailed description is, therefore, not to be taken in a limiting sense, and the scope of the present invention is defined only by the appended claims. 
         [0015]    One embodiment of the invention is suitably implemented in a computing system arranged with clustered nodes of initiators and having a SAN comprising storage units under the control of a storage virtualization engine or appliance. In some storage subsystems LUs are grouped together and accessing these LUs on different targets has similar I/O performance impacts as LU thrashing. This symptom could be referred to as LU group thrashing and it is an advantage of the present invention that this thrashing can be prevented by selecting a single target that all clustered node initiators can use for I/O access for all LUs in the LU group. 
         [0016]    For each LU in the group there is an I/O access ‘path’ for each access Initiator-Target-LU (ITL) nexus. The specific access state of an ITL can be mapped onto Asymmetric Access States (AASs) that describe the capability of the ITL to perform I/O that vary from unable to perform I/O through varying degrees of readiness. An example is the AAS enumeration provided by the well-known SCSI Primary Commands 3 (SPC3) standard specification. However, such enumerations may be provided by other features of non-SCSI environments, and may alternatively be provided by hardware or software features written specifically to support such enumeration in any suitable system. 
         [0017]      FIG. 1  shows an exemplary system configuration for a 2 node SVC cluster and a 2 controller subsystem with 4 targets, 5 LUs and 2 LU groups. In  FIG. 1  are shown an SVC cluster  100  comprising cluster node  102  and cluster node  108 . Cluster node  102  comprises initiator nodes  104 ,  106 . Cluster node  108  comprises initiator nodes  110 ,  112 . In the exemplary arrangement shown in  FIG. 1 , initiator node  104  and initiator node  110  connect to ports on FC (Fiber Channel) switch  114 , and initiator node  106  and initiator node  112  connect to ports on FC switch  116 . FC switch  114  connects to controller port  124  (owned by controller  120 ) and to controller port  128  (owned by controller  122 ). FC switch  116  connects to controller port  126  (owned by controller  120 ) and to controller port  130  (owned by controller  122 ). Storage logical units  132  are divided into two LU groups  134 ,  136 . 
         [0018]    The following describes how the reported AAS states relate to the configuration for each of the LU Groups. The LUs LU-A, LU-B and LU-C form LU Group  1 . LU Group  1  is ‘owned’ by Controller- 1  and so the LUs in LU Group  1  are reported as having the preferred AAS state by the Controller  1  targets, Target  1  and Target  2  (represented by the LU group to controller association marked with a P 1  in  FIG. 1 ). The LUs in LU Group  1  are reported as having the standby AAS state by the non-owning Controller- 2  targets, Target  3  and Target  4  (represented by the LU group to controller association marked with an S 1  in  FIG. 1 ). 
         [0019]    The LUs LU-D and LU-E form LU Group  2 . LU Group  2  is ‘owned’ by Controller- 2  and so the LUs in LU Group  2  are reported as having the preferred AAS state by the Controller  2  targets, Target  3  and Target  4  (represented by the LU group to controller association marked with a P 2  in  FIG. 1 ). The LUs in LU Group  2  are reported as having the standby AAS state by the non-owning Controller- 1  targets, Target  1  and Target  2  (represented by the LU group to controller association marked with an S 2  in  FIG. 1 ). 
         [0020]    In the example the LU group  1  is owned by Controller  1  and so the Target-LU AAS states are said to be ‘preferred’ (as shown in  FIG. 1 ). LU group  2  is not owned by Controller  1  and there would be some performance impact to fail over access to this Controller so the Target-LU AAS states are said to be in ‘standby’ (as shown in  FIG. 1 ). The situation is reversed for Controller  2  that owns LU group  2 . In this example configuration the AAS states provide the SVC nodes with the hint that for optimum I/O performance LUs LU-A, LU-B and LU-C of LU group  1  should be accessed through one of the Controller  1  targets and LUs LU-D and LU-E of LU group  2  should be accessed through the Controller  2  targets. 
         [0021]    A SAN can have problems such as communication, hardware or software failures, and incorrect configurations. This can cause asymmetric conditions such that the ability of individual LUs to service I/O requests for the associated ITLs can be different. This can mean that only a subset of the LUs in the group can service I/O submitted by a subset of the cluster nodes through a subset of the targets. In such asymmetric failure scenarios it can be important that the clustered nodes can continue to provide the best possible I/O capability to the LU group. In order to achieve this as many of the clustered nodes as possible need to be able to access as many of the LUs in the group as possible through the designated target. 
         [0022]    One embodiment of the present invention provides a technique for the clustered nodes to decide which storage subsystem I/O target to use for an LU group in order to maximize the I/O service capability when asymmetric failure conditions occur. In one embodiment of the invention an advantageous method is used by the clustering engine to select a target to use for an LU group. The clustered nodes that have access (at any given point in time) can then preferentially send I/O to the selected target. 
         [0023]    An exemplary apparatus or arrangement of apparatus according to an embodiment of the invention is now described, with reference to the schematic diagram of  FIG. 2 , in which a target selector engine  200  is in communication, using a communication module  208 , with a clustering engine  202  and LU groups  204 . The target selector engine comprises a state definition component  206 , operable to define the AAS states described above, and a profiler  210 , operable to compile the state profiles. Criteria compiler  212  is operable to compile the rank criteria which best-fit identifier  214  communicates to target selector  216 , which in turn is operable to provide a selected target for LU group I/O activity as described above. 
         [0024]    One embodiment of the present invention in the form of an apparatus or arrangement of apparatus thus advantageously addresses the problem of providing a technical means for improved control of clustered nodes in storage subsystems. The various components and mechanisms of  FIG. 2  can perform the parts and steps of the method of  FIG. 3  that is described later in the detailed description. Furthermore, in one embodiment, the various components and mechanisms correspond to and implement means that perform the functionality ascribed to these components and mechanisms throughout the present patent application. 
         [0025]    A method according to one embodiment method may be broadly described as following the steps shown in  FIG. 3 , following the START step  300 . First, in step  302 , the AAS states associated with cluster Node-Target-LU (NTL, where N is a group of initiators that operate together as a cluster Node) are defined. Next, in step  304 , the NTL AAS states are communicated from all cluster nodes to the clustering engine. In step  306 , a target AAS state profile is produced for each target. In step  308 , rank criteria compiled from the AAS states are defined in terms of desired I/O capability. In step  310 , the targets with the ‘best fit’ of AAS states for the LU group are identified. Finally, in step  312 , one of the best fit matching targets for LU group I/O submission is selected. The steps of the method end at the END step  314 . 
         [0026]    This method has the benefit that it takes into account all NTL AAS for the entire LU group and selects the target with the ‘best fit’ LU access. The best fit aims to achieve a balance between the following desirable I/O capability characteristics. The first characteristic is to maximize the continuation of existing I/O service availability for the LU group. The second characteristic is to maximize the post target failover I/O service availability for the LU group. The third characteristic is to maximize the post target failover I/O service reliability for the LU group. The fourth characteristic is to minimize the performance impact of target failover for the LU group. 
         [0027]    This method also has the benefit that it is scalable to any size of LU group the system can support. This is possible as the clustering performance cost of the LU group target selection algorithm is similar to that for the same number of LUs that are independent of any group. 
         [0028]    One embodiment of the present invention in the form of a method or logic arrangement thus advantageously addresses the problem of providing a technical means for improved control of clustered nodes in storage subsystems. The different steps of the method used by the clustering engine to select a target are now explained in more detail. 
         [0000]    Step 1. Define the AAS States Associated with Cluster Node-Target-LU (NTL, where N is a Group of Initiators that Operate Together as a Cluster Node) 
         [0029]    For the purposes of this LU group target selection method, only NTLs with AAS in available states are considered. This is because unavailable NTLs cannot process I/O and are therefore not considered. The notion of availability represents the capability to do I/O through the ITLs associated with the NTL context (regardless of performance penalty). If an NTL is available it can perform I/O. 
         [0030]    An example set of available AAS states which are based on a combination of the SCSI SPC3-defined AAS states and additional SVC I/O performance status includes NTL_AAS_DEGRADED, NTL_AAS_STANDBY, NTL_AAS_READY, and NTL_AAS_PREFERRED. The state NTL_AAS_DEGRADED denotes that an NTL relationship exists but the I/O service capability is degraded. The state NTL_AAS_STANDBY denotes that an NTL relationship exists and is capable of processing I/O after a specific failover command with some failover performance impact. The state NTL_AAS_READY denotes that an NTL relationship exists and is capable of processing I/O with some failover performance impact. The state NTL_AAS_PREFERRED denotes that an NTL relationship exists and is capable of processing I/O with no failover performance impact. 
         [0031]    This AAS enumeration is used hereafter to explain an embodiment of the present invention. 
         [0000]    Step 2. Communicate NTL AAS States from all Cluster Nodes to the Clustering Engine 
         [0032]    The discovered NTL AAS states are reported by each cluster node for every available Target-LU nexus to the clustering engine (that is, for each NTL). During each SAN discovery cycle the access states for the node ITLs are resolved into one NTL AAS state and any NTL AAS changes reported to the clustering engine. The clustering engine records all of the NTL AAS states to build up a state map that is then made available for target port selection purposes. 
       Step 3. Produce a Target AAS State Profile for Each Target 
       [0033]    This part of the method aims to build up a profile of the AAS states for a target from all the NTLs associated with the target and the LU group. The profile is generated by the clustering engine based on the NTL AAS state map that was compiled in Step 2. For each Target, counts of the LU group NTLs in each of the AAS states are summed. These counts are then stored for analysis in the decision steps 4-6. In addition, for each target, the count of paths that are presently available, online and in use that will continue to be available post failover is recorded in the target profile. 
         [0034]    For the purposes of this invention the target profile consists of the following RAW AAS counts and COMBINED counts: RAW_DEGRADED, RAW_STANDBY, RAW_READY, RAW_PREFERRED, COMBINED_HEALTHY, COMBINED_AVAILABLE, and COMBINED_ONLINE. The RAW_DEGRADED count is the count of NTLs that are in the NTL_AAS_DEGRADED state for this target. The RAW_STANDBY count is the count of NTLs that are in the NTL_AAS_STANDBY state for this target. The RAW_READY count is the count of NTLs that are in the NTL_AAS_READY state for this target. The RAW_PREFERRED count is the count of NTLs that are in the NTL_AAS_PREFERRED state for this target. The COMBINED_HEALTHY count is equal to RAW_PREFERRED+RAW_READY+RAW_STANDBY. The COMBINED_AVAILABLE count is equal to RAW_PREFERRED+RAW_READY+RAW_STANDBY+RAW_DEGRADED. Finally, the COMBINED_ONLINE count is the count of NTLs that are presently online, available and in use, and have an available AAS state for this target. 
         [0000]    Step 4. Define Rank Criteria Compiled from the AAS States in Terms of Desired I/O Capability 
         [0035]    The best fit targets are selected to achieve the desired I/O capability. The target AAS state profiles are used to compile rank criteria to allow the best fit target(s) to be selected. The rank criteria include RANK_ONLINE, RANK_AVAILABLE, RANK_HEALTHY, RANK_PREFERRED, RANK_READY, and RANK_STANDBY. The RANK_ONLINE criterion is equal to COMBINED_ONLINE. The RANK_AVAILABLE criterion is equal to COMBINED_ONLINE+COMBINED_AVAILABLE. The RANK_HEALTHY criterion is equal to COMBINED_ONLINE+COMBINED_AVAILABLE+COMBINED_HEALTHY. The RANK_PREFERRED criterion is equal to COMBINED_ONLINE+COMBINED_AVAILABLE+COMBINED_HEALTHY+RAW_PREFERRED. The RANK_READY criterion is equal to COMBINED_ONLINE+COMBINED_AVAILABLE+COMBINED_HEALTHY+RAW_PREFERRED+RAW_READY. The RANK_STANDBY criterion is equal to COMBINED_ONLINE+COMBINED_AVAILABLE+COMBINED_HEALTHY+RAW_PREFERRED+RAW_READY+RAW_STANDBY. 
         [0036]    The ranks have the following effect on the desired I/O capability. The RANK_ONLINE criterion maximizes the continuation of existing I/O service availability for the LU group. The RANK_AVAILABLE criterion maximizes the post failover I/O service availability for the LU group. The RANK_HEALTHY criterion maximizes the post failover I/O service reliability for the LU group. The RANK_PREFERRED, RANK_READY, and RANK_STANDBY criteria minimize the performance impact of failover for the LU group. 
         [0000]    Step 5. Identify the Targets with the Best Fit of AAS States for the LU Group 
         [0037]    For a given rank the target(s) with the highest rank criteria count are said to be the best fit. Each rank is processed in turn and so the targets are progressively filtered out until only the best fit targets remain. This means that the order of application of the rank criteria defines their precedence. In one embodiment, the rank application order is, from first to last: RANK_ONLINE, RANK_AVAILABLE, RANK_HEALTHY, RANK_PREFERRED, RANK_READY, and RANK_STANDBY. 
         [0038]    As such, the controller of one embodiment places the following priority order on the target selection decision, from most important to least important: keeping the existing availability of the LU group; making the most LU resources available; making the LU resource access the most reliable; and, having the least target failover performance impact. In a further enhancement to the system of one embodiment of the invention, the extension described below may be implemented. 
       Step 6. Select One of the Best Fit Targets for LU Group I/O Submission 
       [0039]    It is possible for the set of best fit targets found in Step (5) to contain a single target or multiple targets. When the outcome is multiple best fit targets, further analysis is required to select the target to use. For example, this final decision may be based on the following additional ranking criteria. The first criterion is to choose the target based on available target I/O bandwidth, which maximizes post failover performance. The second criterion is to choose the existing selected target (if part of best fit target set), which minimizes impact of failovers that are not required. Finally, if there is still more than one best fit target then an arbitrary target can be chosen from the best fit set. For example the first target in the best fit set could be chosen. 
       Other Potential Methods 
       [0040]    For step (4) other definitions for rank criteria counts may include the following. First, the rank criteria counts can include the count of LUs (Ls) that are available for all nodes (maximizes complete availability for LUs). Second, the rank criteria counts can include the count of Nodes (Ns) that have all LUs available (maximizes complete availability for Nodes). 
         [0041]    The selection process for I/O targets may be accomplished based on user preferences input to the apparatus or arrangement of  FIG. 2  using input means  215 , and that a rules engine  217  or the like may be used to implement the process of target selection. All or part of the method of embodiments of the present invention may suitably and usefully be embodied in a logic apparatus, or a plurality of logic apparatus, comprising logic elements arranged to perform the steps of the method and that such logic elements may comprise hardware components, firmware components or a combination thereof. 
         [0042]    All or part of a logic arrangement according to embodiments of the present invention may suitably be embodied in a logic apparatus comprising logic elements to perform the steps of the method, and that such logic elements may comprise components such as logic gates in, for example a programmable logic array or application-specific integrated circuit. Such a logic arrangement may further be embodied in enabling elements for temporarily or permanently establishing logic structures in such an array or circuit using, for example, a virtual hardware descriptor language, which may be stored and transmitted using fixed or transmittable carrier media. 
         [0043]    It can be appreciated that the method and arrangement described above may also suitably be carried out fully or partially in software running on one or more processors, and that the software may be provided in the form of one or more computer program elements carried on any suitable data-carrier such as a magnetic or optical disk or the like. Channels for the transmission of data may likewise comprise storage media of all descriptions as well as signal-carrying media, such as wired or wireless signal-carrying media. 
         [0044]    The present invention may further suitably be embodied as a computer program product for use with a computer system. Such an implementation may comprise a series of computer-readable instructions either fixed on a tangible medium, such as a computer readable medium, for example, diskette, CD-ROM, ROM, or hard disk, or transmittable to a computer system, via a modem or other interface device, over either a tangible medium, including but not limited to optical or analogue communications lines, or intangibly using wireless techniques, including but not limited to microwave, infrared or other transmission techniques. The series of computer readable instructions embodies all or part of the functionality previously described herein. 
         [0045]    Such computer readable instructions can be written in a number of programming languages for use with many computer architectures or operating systems. Further, such instructions may be stored using any memory technology, present or future, including but not limited to, semiconductor, magnetic, or optical, or transmitted using any communications technology, present or future, including but not limited to optical, infrared, or microwave. It is contemplated that such a computer program product may be distributed as a removable medium with accompanying printed or electronic documentation, for example, shrink-wrapped software, pre-loaded with a computer system, for example, on a system ROM or fixed disk, or distributed from a server or electronic bulletin board over a network, for example, the Internet or World Wide Web. 
         [0046]    In an alternative, an embodiment of the present invention may be realized in the form of a computer implemented method of deploying a service comprising steps of deploying computer program code operable to, when deployed into a computer infrastructure and executed thereon, cause the computer infrastructure to perform all the steps of the method. In a further alternative, an embodiment of the present invention may be realized in the form of a data carrier having functional data thereon, the functional data comprising functional computer data structures to, when loaded into a computer system and operated upon thereby, enable the computer system to perform all the steps of the method. 
         [0047]    It is finally noted that, although specific embodiments have been illustrated and described herein, it can be appreciated by those of ordinary skill in the art that any arrangement calculated to achieve the same purpose may be substituted for the specific embodiments shown. This application is intended to cover any adaptations or variations of embodiments of the present invention. Therefore, it is manifestly intended that this invention be limited only by the claims and equivalents thereof.