Abstract: Embodiments of the present disclosure provide techniques to vary on and vary off databases simultaneously across a pair of nodes in a mirroring environment. A dual vary off operation is initiated at a first node of the pair of nodes, the dual vary off operation to be performed on copies of a database respectively stored on the pair of nodes, the operation to be performed in tandem with the second node. At the first node the copy of the database stored on the first node is informed of the dual vary off operation, and an operating system of the first node is also informed of the dual vary off operation. Upon receipt at the first node of an indication from the second node that it has completed its vary off operation, the first node completes the dual vary off operation. An analogous technique is performed for a dual vary on operation.

Abstract: Techniques for concurrent node startup are provided. A first startup instruction is received by a first node of a plurality of nodes, and the first node enters an initial startup state. The first node further transmits a first ping to the plurality of nodes, and determines, based on the first ping, that none of the plurality of nodes are in an active state or in a secondary startup state. Upon determining that no additional pings have been received, the first node enters the secondary startup state. Finally, the first node enters the active state, where the first node enters the active state as an initial node in a new cluster.

Abstract: In embodiments, the ability to have two separate Db2 Mirror pair environments, each providing HA, which have the capability to switch application spaces between the Db2 Mirror pairs, is presented. At least one IASP is registered to a first node of a first pair of nodes at a first HA mirroring environment at a first location. The at least one IASP is replicated to a second HA mirroring environment, the second HA mirroring environment including a second pair of nodes at a second location, the second location different than the first location. The at least one IASP is registered with one node of the pair of nodes of the second mirroring environment, the at least one IASP is switched offline at the first pair of nodes of the first mirroring environment, and subsequently switched online at the second pair of nodes of the second mirroring environment.

Abstract: Method and apparatus for loading new code in the initial program load (IPL) path to reduce system restarts may be provided by receiving a new component for an operating system (OS) running on a computing device; identifying a given component of the OS that is currently running as corresponding to the new component; updating a header of the given component to indicate that the given component is to-be-updated a filepath for the new component; upon initializing the operating system during a subsequent boot of the computing device, checking the header of the given component when loading the given component from an IPL path for the OS to determine that the given component is to-be-updated, and in response: loading the new component into the IPL path according to the filepath within the header of the given component; removing the given component from the IPL path; and executing the new component.

Abstract: In embodiments, the ability to have two separate Db2 Mirror pair environments, each providing HA, which have the capability to switch application spaces between the Db2 Mirror pairs, is presented. At least one IASP is registered to a first node of a first pair of nodes at a first HA mirroring environment at a first location. The at least one IASP is replicated to a second HA mirroring environment, the second HA mirroring environment including a second pair of nodes at a second location, the second location different than the first location. The at least one IASP is registered with one node of the pair of nodes of the second mirroring environment, the at least one IASP is switched offline at the first pair of nodes of the first mirroring environment, and subsequently switched online at the second pair of nodes of the second mirroring environment.

Abstract: Embodiments of the present disclosure provide techniques to vary on and vary off databases simultaneously across a pair of nodes in a mirroring environment. A dual vary off operation is initiated at a first node of the pair of nodes, the dual vary off operation to be performed on copies of a database respectively stored on the pair of nodes, the operation to be performed in tandem with the second node. At the first node the copy of the database stored on the first node is informed of the dual vary off operation, and an operating system of the first node is also informed of the dual vary off operation. Upon receipt at the first node of an indication from the second node that it has completed its vary off operation, the first node completes the dual vary off operation. An analogous technique is performed for a dual vary on operation.

Abstract: Techniques for concurrent node startup are provided. A first startup instruction is received by a first node of a plurality of nodes, and the first node enters an initial startup state. The first node further transmits a first ping to the plurality of nodes, and determines, based on the first ping, that none of the plurality of nodes are in an active state or in a secondary startup state. Upon determining that no additional pings have been received, the first node enters the secondary startup state. Finally, the first node enters the active state, where the first node enters the active state as an initial node in a new cluster.

Abstract: Disclosed aspects relate to local encryption of a set of replicated data in a shared pool of configurable computing resources which has a set of member nodes. A first local encryption key for the first node of the set of member nodes may be determined. The first local encryption key for the first node of the set of member nodes may be generated. A second local encryption key for the second node of the set of member nodes may be determined. The second local encryption key may differ from the first local encryption key. The second local encryption key for the second node of the set of member nodes may be generated. A temporary key for utilization by both the first and second nodes may be generated. The set of replicated data may be updated using the first local encryption key, the temporary key, and the second local encryption key.

Abstract: Method and apparatus for loading new code in the initial program load (IPL) path to reduce system restarts may be provided by receiving a new component for an operating system (OS) running on a computing device; identifying a given component of the OS that is currently running as corresponding to the new component; updating a header of the given component to indicate that the given component is to-be-updated a filepath for the new component; upon initializing the operating system during a subsequent boot of the computing device, checking the header of the given component when loading the given component from an IPL path for the OS to determine that the given component is to-be-updated, and in response: loading the new component into the IPL path according to the filepath within the header of the given component; removing the given component from the IPL path; and executing the new component.

Abstract: Techniques disclosed herein describe performing client-requested disk management operations to storage disk units of a storage area network (SAN). A proxy service receives a request from a client of a SAN provider to perform a disk management operation on one or more storage disk units of the SAN provider. The proxy service evaluates a configuration of storage disk units allocated to the client to determine whether the request is valid. If valid, the proxy service performs the requested action to the specified storage disk units on behalf of the client.

Abstract: Techniques disclosed herein describe performing client-requested disk management operations to storage disk units of a storage area network (SAN). A proxy service receives a request from a client of a SAN provider to perform a disk management operation on one or more storage disk units of the SAN provider. The proxy service evaluates a configuration of storage disk units allocated to the client to determine whether the request is valid. If valid, the proxy service performs the requested action to the specified storage disk units on behalf of the client.

Abstract: A method, and system for implementing enhanced fast full synchronization for remote disk mirroring in a computer system. A source backup copy is made locally available to a target for remote disk mirroring. Sectors are identified that are different between the source and target. A hash function is used over a block to be compared, with an adaptive number of tracking sectors per block, starting with a minimum block size.

Abstract: Disclosed aspects relate to local encryption of a set of replicated data in a shared pool of configurable computing resources which has a set of member nodes. A first local encryption key for the first node of the set of member nodes may be determined. The first local encryption key for the first node of the set of member nodes may be generated. A second local encryption key for the second node of the set of member nodes may be determined. The second local encryption key may differ from the first local encryption key. The second local encryption key for the second node of the set of member nodes may be generated. A temporary key for utilization by both the first and second nodes may be generated. The set of replicated data may be updated using the first local encryption key, the temporary key, and the second local encryption key.

Abstract: A clustered system has a subset of nodes coupled to a particular cluster resource. Nodes not coupled to the cluster resource may operate on a cluster resource through a node coupled to that resource. The nodes coupled to the resource form a group, the nodes in the group perform protocols to operate on the cluster resource, nodes not in the group do not participate in the protocols.

Abstract: A method, and system for implementing enhanced fast full synchronization for remote disk mirroring in a computer system. A source backup copy is made locally available to a target for remote disk mirroring. Sectors are identified that are different between the source and target. A hash function is used over a block to be compared, with an adaptive number of tracking sectors per block, starting with a minimum block size.

Abstract: A clustered system has a subset of nodes coupled to a particular cluster resource. Nodes not coupled to the cluster resource may operate on a cluster resource through a node coupled to that resource. The nodes coupled to the resource form a group, the nodes in the group perform protocols to operate on the cluster resource, nodes not in the group do not participate in the protocols.

Abstract: A method, and system for implementing enhanced fast full synchronization for remote disk mirroring in a computer system. A source backup copy is made locally available to a target for remote disk mirroring. Sectors are identified that are different between the source and target. A hash function is used over a block to be compared, with an adaptive number of tracking sectors per block, starting with a minimum block size.

Abstract: An independent product upgrade function is associated with each of multiple software products installed in a set of multiple computing devices. Responsive to a triggering event, each upgrade function determines whether the corresponding product can be updated based on rules for the corresponding product. Upgrade may be dependent on other products, but the upgrade function need not know the conditions for upgrading other products. If a product can be updated, update is performed and all other products are notified. Each of the other product upgrade functions then determines whether its corresponding product can be upgraded as a result of the recent upgrade to the first product, and if so, another set of notifications is sent. This cycle continues until all dependent products have been updated. Upgrade functions preferably operate in a peer-to-peer relationship, and upgrade can be initiated in any node.

Abstract: An independent product upgrade function is associated with each of multiple software products installed in a set of multiple computing devices. Responsive to a triggering event, each upgrade function determines whether the corresponding product can be updated based on rules for the corresponding product. Upgrade may be dependent on other products, but the upgrade function need not know the conditions for upgrading other products. If a product can be updated, update is performed and all other products are notified. Each of the other product upgrade functions then determines whether its corresponding product can be upgraded as a result of the recent upgrade to the first product, and if so, another set of notifications is sent. This cycle continues until all dependent products have been updated. Upgrade functions preferably operate in a peer-to-peer relationship, and upgrade can be initiated in any node.

Abstract: A method, and system for implementing enhanced fast full synchronization for remote disk minoring in a computer system. A source backup copy is made locally available to a target for remote disk mirroring. Sectors are identified that are different between the source and target. A hash function is used over a block to be compared, with an adaptive number of tracking sectors per block, starting with a minimum block size.