Abstract: Techniques are provided for distributing event messages from a first service to additional services using a message store. One method comprises obtaining, by a first service, from a second service, messages associated with the second service, wherein the second service provides a given message, comprising information related to a given event associated with the second service, to the first service in response to an occurrence of the given event; and providing, by the first service, the messages to a message store, wherein each message is published on the message store, and wherein at least one additional service consumes one or more of the published messages on the message store. The message store may comprise a sequential message queue implemented using an event streaming platform. The plurality of messages may also be stored in a data store that supports access (e.g., query access) by the at least one additional service.

Abstract: Techniques are provided for distributing event messages from a first service to additional services using a message store. One method comprises obtaining, by a first service, from a second service, messages associated with the second service, wherein the second service provides a given message, comprising information related to a given event associated with the second service, to the first service in response to an occurrence of the given event; and providing, by the first service, the messages to a message store, wherein each message is published on the message store, and wherein at least one additional service consumes one or more of the published messages on the message store. The message store may comprise a sequential message queue implemented using an event streaming platform. The plurality of messages may also be stored in a data store that supports access (e.g., query access) by the at least one additional service.

Abstract: A technique for managing storage space in a data storage system generates liability values on a per-family basis, with each family including files in the file system that are related to one another by snapping. Each family thus groups together files in the file system that generally share at least some blocks among one another based on snapshot activities. Distinct files that do not share blocks based on snapping are provided in separate families. The technique further generates worst-case storage liability of a version family by differentiating between writable data objects and read-only data objects, thus allowing administrators to provide spare storage and/or prepare for increases in storage requirements as writable data objects grow and differentiate.

Abstract: Techniques are described for performing a copy operation. A first request is received to perform a copy operation to copy source data from a source area to a target area. The first request is partitioned into a plurality of other requests. Each of the plurality of other requests being a request to copy a portion of source data located in the source area to a corresponding location in the target area. A first number of the other requests is issued. Responsive to the issued requests, a copy operation is performed to copy a portion of the source data from the source area to the target area. Completion of a second number of the issued other requests is detected. The second number corresponds to a fraction of the first number such that the second number is greater than one and less than the first number. Upon detecting completion of the second number, a third number of the other requests is issued to copy another portion of the source data from the source area to the target area.

Abstract: A hierarchy of multiple levels of storage resources and associated QOS (quality of service) limits and buckets of tokens may be specified. A different QOS limit may be applied to each individual storage resource. The buckets may denote current amounts of tokens available for consumption in connection with servicing I/O operations. Each bucket may denote a current amount of available tokens for a corresponding storage resource of included in the hierarchy. Processing may include receiving a first I/O operation directed to a first storage resource, and determining, in accordance with the buckets of available tokens, whether to service the first I/O operation.

Abstract: Techniques are described for copying data. At a first storage processor, a copy request is received to copy data including copying source data from a source area of a source logical device to a destination area of a destination logical device. The source logical device is owned by the first storage processor and the destination logical device is owned by a second storage processor. The first storage processor receives, from the second storage processor, destination location physical storage mapping information for the destination area. A destination physical device location corresponding to the destination area is determined. The source data from the source area is stored in a first cache location of a first data cache of the first storage processor. The first cache location is modified to indicate it includes write pending data for the destination physical device location. The source data is destaged to the destination physical device location.

Abstract: A technique for replicating a file from a source data storage system (source) to a destination data storage system (destination) includes receiving, by the destination from the source, (i) file data for multiple logical extents of the file and (ii) respective tiering metadata for those logical extents. The destination selects, based on the tiering metadata, one or more storage tiers available on the destination. The destination updates a local replica of the file by placing the logical extents on the selected tier or tiers.

Abstract: Storage system characteristics are processed to generate a service level for a storage system that is one of a fixed number of service levels. Application specific usage tags describing application types the storage system is appropriate to support may also be generated. The service level and application specific usage tags are stored into a storage system capability profile and made available, together with any metadata needed to describe the application specific usage tags, to a system associated with a virtualization environment. A request to provision storage resources for a virtual machine is subsequently received, including a policy profile having a requested service level and one or more application specific usage tags describing the storage requirements of the virtual machine. If the policy profile matches the capability profile, storage resources are provisioned for the virtual machine from the storage system.

Abstract: A copy technique involves generating, upon receiving a command to copy at least a portion of a source file, a set of pointers for a destination file that point to a set of pointers for the source file (“physical block pointers”), which in turn point to physical blocks storing data of the file in a storage system. In response to the copy command, a storage processor allocates an inode from an inode table of a file system for the destination file and stores a set of inode pointers in the inode of the destination file that point to the set of pointers for the source file. Thus, instead of creating a redundant copy of the data of the source file, the improved creates technique creates pointers that point to the data stored for the source file.

Abstract: A technique forms contents of a deduplication container from a standalone container file system stored on the same data storage array on which the deduplication container is stored. Such a standalone container includes a container file which is formed by standalone blocks that are not shared with any other file within the standalone container outside of snapshots of that file. The standalone blocks store host data and which are hierarchically related to each other. Upon receiving a deduplication command, the storage processor carries out a set of deduplication operations which include creating and storing the deduplication container in the data storage array. The deduplication container includes container files which are formed by deduplication blocks storing the host data and which are hierarchically related to each other.

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 is used for optimizing data location in data storage arrays. A primary storage array is associated with a secondary storage array, the primary storage array and secondary storage array including auto-tiering functionality, where the secondary storage array is configured as a backup storage array for the primary storage array. Tiering metadata is derived for a storage object stored on the primary storage array. The tiering metadata is transmitted to the secondary storage array. Auto-tiering is initiated at the secondary storage array, where the received tiering metadata is provided as input to the secondary storage array's auto-tiering function when auto-tiering replicated storage object associated with the tiering metadata.

Abstract: A data storage system, method and computer program product for managing copy on first write data for snapshot purposes are disclosed. In one embodiment, a determination is made whether new data is a first update of original data in a first section of a data storage device in response to receiving a write instruction to write the new data. The new data is provided to a first location of a cache memory and the original data to a second location of the cache memory. Providing the new data to the first location in the cache memory is not dependent on whether the original data has been copied from the data storage device. Further, the original data can be provided to the second location of the cache memory after new data is provided to first location of the cache memory. Completion of the write instruction is confirmed in response to providing the new data to the first location of the cache memory.

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 method is used in managing data compression in storage systems. A request to compress particular data stored within a memory space is received. An activity level for the particular data is determined. Compression is enabled for data determined to have an activity level below a predetermined threshold and compression is disabled for data determined to have an activity level above the predetermined threshold.

Abstract: Systems, methods, and computer readable media for accessing and compressing data at a virtually provisioned storage entity are disclosed. According to one aspect, a method includes receiving, at a data storage entity, an input/output (I/O) command to perform an operation on data associated with a logical block address (LBA) in a virtually provisioned device in the data storage entity, wherein the data storage entity has established an expanded private LBA space for the virtually provisioned device in the data storage entity to include both a compressed LBA space portion for storing compressed data and an associated uncompressed LBA space portion for storing uncompressed data. The method further includes determining if a data chunk containing the data in the uncompressed LBA space is available using the LBA in the I/O command to access the data chunk. If the data chunk in the uncompressed LBA space is available, the method includes performing the operation on the data chunk.

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: 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 forms contents of a compression container from a standalone container file system stored on the same data storage array on which the compression container is stored. Such a standalone container includes a container file which is formed by standalone blocks. The standalone blocks store host data and which are hierarchically related to each other. Upon receiving a compression command, the storage processor carries out a set of compression operations which include creating and storing the compression container in the data storage array. The compression container includes container files which are formed by compression blocks storing the host data and which are hierarchically related to each other.