Abstract: Techniques are described for performing a copy operation. A first request is received to perform a copy operation. The first request includes a set of parameters in accordance with a defined interface and include a source area and a target area. The source area includes source ranges and source devices. Each of the source ranges identifies a portion of a logical address range of a different one of the source devices. The target area includes target ranges and target devices. Each of the target ranges identifies a portion of a logical address range of a different one of the target devices. The first request is partitioned in to a plurality of other requests each of which is a request to copy a portion of source data located in the source area to a corresponding location in the target area. The other requests are then issued.

Abstract: Techniques are described for generating a unique identifier by a first processor using a plurality of values including a shared value, the first processor's identifier, a container identifier and a time value. The shared value is a common value used by a plurality of processors including the first processor. The container identifier identifies a memory location. The time value denotes an amount of time that has elapsed since the first processor was last booted.

Abstract: A technique manages peer messaging across multiple SPs of a data storage array. The technique involves using a token, by a first SP of the data storage array, to identify particular data stored at a source storage location on the data storage array. The technique further involves starting, by the first SP, multiple WUT operations which use the token in response to multiple WUT requests, each WUT operation moving the particular data from the source storage location to a respective destination storage location. The technique further involves providing, by the first SP, a single “touch” message in response to starting the multiple WUT operations by the first SP, the single “touch” message informing a set of other SPs of the data storage array that the token which identifies the particular data has been touched.

Abstract: A technique manages token states across multiple storage processors (SPs) of a data storage array. The technique involves using a token, by a first SP, to identify particular data stored on the array. The technique further involves updating, by the first SP, a first SP-controlled set of token state information for the token, the first SP-controlled set of token state information including (i) a first token state which indicates whether the token is “idle” or “busy” from a perspective of the first SP and (ii) a second token state which indicates whether the token is “idle” or “busy” from a perspective of a second SP. The technique further involves expiring, by the first SP, the token in response to the first SP-controlled set of token state information indicating that the token has remained “idle” for at least a predefined amount of time.

Abstract: A method is used for managing consistency groups in storage systems. A consistency group comprising multiple logical objects is created and multiple replicas of the consistency group are created. The consistency group is restored to one of the multiple replicas.

Abstract: A method, computer program product, and computing system for defining a first virtual object, wherein the first virtual object includes a first ready state indicator. At least a second virtual object is defined, wherein the at least a second virtual object includes at least a second ready state indicator. The first virtual object and the at least a second virtual object are grouped within a group virtual object.

Abstract: Techniques are described for generating a unique identifier by a first processor using a plurality of values including a shared value, the first processor's identifier, a container identifier and a time value. The shared value is a common value used by a plurality of processors including the first processor. The container identifier identifies a memory location. The time value denotes an amount of time that has elapsed since the first processor was last booted.

Abstract: A method is used for managing snapshot mount points in storage systems. A request to resize a snapshot mount point is received and a file object associated with the snapshot mount point is retrieved. The file object is analyzed to determine a file attached to the snapshot mount point and a file ID is determined for an underlying file associated with the determined file. The file associated with the file ID is resized.

Abstract: A method is used in managing consistency groups in storage systems. A consistency group is created from a set of snapshot mount points. A snapshot mount point is a logical object accessible for using a replica of a logical volume. An operation is performed on the consistency group.

Abstract: Described are techniques for determining noteworthy events. A client performs a first call to a first routine having a first interface. The first interface includes a first set of input parameters specifying noteworthiness criteria indicating which event occurrences in a sequence of event occurrences are noteworthy. The client performs a second call to a second routine having a second interface to record an event occurrence of the sequence. The second routine perform processing returning information to the client including an indicator value denoting whether the event occurrence is noteworthy. In response to receiving the indicator value, the client may perform an action if the indicator value denotes that the event occurrence is noteworthy.

Abstract: A system for performance optimization of storage allocation to virtual logical units includes a storage entity having data storage space divided into slices for storing data. A slice allocation table stores slice allocation status. A memory stores statistics regarding the allocation of slices to logical units. A management database stores information regarding the allocation of slices to logical units. An allocation module performs an allocation process in response to receiving an I/O write request. A management module performs scheduled post-I/O management processes asynchronously with allocation processes, including updating the management database to reflect the allocation of the selected slice, and updating the status of the selected slice in the slice allocation table to indicate that the post-I/O management process for the selected slice has been performed.

Abstract: A method is used in managing database access. A framework is provided for translating versioned data between memory and persistent storage. Based on the framework, read and write requests that access records in a database are translated. Based on the framework, it is made to appear that the database is a different version of the database.

Abstract: Systems, methods, and computer readable media for triggering and coordinating pool storage reclamation are disclosed. According to one example, the method includes receiving an issued hint triggered by the execution of a data storage optimization operation applied to a mapped logical unit (MLU), wherein the MLU is one of a plurality of MLUs residing in a storage array, and computing an unused portion amount of an allocated storage space in the MLU, wherein the allocated storage space comprises a plurality of slices. If the unused portion amount exceeds a predetermined threshold value, detecting at least one of the slices to be released from the allocated storage space. The method also includes transferring data contained in a detected slice to at least one of the remaining slices in the allocated storage space, and removing the detected slice from the allocated storage space in the MLU to a common storage pool in the storage array, wherein the removed slice is allocated to any one of the plurality of MLUs.

Abstract: Methods, systems, and computer program products for identifying and enforcing software feature limits across different hardware platforms, software releases, and tiers are disclosed. According to one method, a feature limit data structure is stored on the hardware platform. Each entry in the feature limit data structure is indexed by at least a software program identifier, a software release level identifier, and a feature name. When software is initialized, its release level is determined. A feature limit manager separate from the software being initialized is invoked. At least the software program identifier, the release level, and the feature identifier are provided as input to the feature limit manager. The feature limit manager provides a feature limit value. The feature limit value is stored and the software uses the feature limit value to enforce the feature limit during execution.

Abstract: The present invention provides a method for providing snapshots of data at different times and for performing rollbacks to a selected snapshot that does not result in any subsequent snapshots being rendered unusable. The method includes a mapping mechanism wherein when a map entry for a block being written to for the first time during a session exists, then another map entry is created and all later sessions are applied to it. When a map entry for the block does not exist, a new map entry is provided and all prior sessions are applied to it.