In one example, workload attributes associated with workloads running in a virtualized computing environment may be retrieved. A distance analysis may be performed using the retrieved workload attributes to generate a distance matrix that identifies a distance between each workload and each other workload. Further, a cluster analysis may be performed on the workloads based on the distance matrix to generate clusters, where each cluster may include identical workloads. Furthermore, the identical workloads in each cluster may be associated with at least one security policy to provide security services in the virtualized computing environment.

A computer-implemented method and computer system for managing a group of storage devices in a storage system utilizes actual wear levels of the storage devices within the group of storage devices to sort the storage devices in an order. One of the storage devices is then selected as a target storage device based on wear level gaps between adjacent sorted storage devices using a target storage device wearing profile so that write operations from software processes are directed exclusively to the target storage device for a predefined period of time to control wear on the group of storage devices.

A storage system monitors the first access frequency of occurrence which is the access frequency of occurrence from a host device during a first period, and the second access frequency of occurrence which is the access frequency of occurrence from a host device during a second period shorter than the first period. Along with performing data relocation among the tiers (levels) in the first period cycle based on the first access frequency of occurrence, the storage system performs a decision whether or not to perform a second relocation based on the first access frequency of occurrence and the second access frequency of occurrence, synchronously with access from a host device. Here the threshold value utilized in a decision on whether or not to perform the first relocation is different from the threshold value utilized in a decision on whether or not to perform the second relocation.

A clustered storage system may include potentially many different nodes, each including a storage driver and a scheduler agent. A node may mount a virtual storage volume for the use of a container application at the node. When a master node receives a request to instantiate a new containerized application, a scheduler at the master node may determine prioritization information for the new containerized application. The prioritization information may prioritize one or more nodes at which a virtualized storage volume employed by the application container instance is mounted.

A method is used in managing an asynchronous and synchronous transmit priority mechanism. The method receives a plurality of replication requests in conjunction with a replication process, where the plurality of replication requests comprises at least one of a first replication request or a second replication request. A first storage system that comprises a plurality of storage devices is configured to participate in the replication process with a second storage system that comprises a plurality of storage devices. The method determines an execution order to optimize processing of the plurality of replication requests, where a first replication request execution order that optimizes processing of the at least one first replication request conflicts with optimizing processing of the at least one second replication request.

Techniques for handling pattern identifiers in a data storage system. By replacing a block pointer with a pattern identifier, the techniques can identify a data block (or an indirect data block) as a bad block, without resorting to the use of a separate flag or bad block (BB) bit in per-block metadata (e.g., a mapping pointer) of the data block. The techniques can also avoid waste of valuable metadata space by using pattern identifiers at various levels of a mapping tree, leveraging pointer granularity at lower levels, mid-levels, and progressively higher levels of the mapping tree.

The technology disclosed herein enables a group of clients to concurrently access data of a distributed storage system over multiple paths without including a client portion of the distributed storage system. An example method may include: determining, by a processing device, a portal group comprising a plurality of network portals for accessing a storage unit; transmitting data of the portal group to a first client and to a second client, wherein data transmitted to the first client indicates a first network portal is preferred and wherein data transmitted to the second client indicates a second network portal is preferred; and providing access for the first client to the storage unit using a storage session, the storage session providing the first client multiple paths to access the storage unit, wherein one of the multiple paths comprises the first network portal.

A technique manages data storage equipment. The technique involves receiving queue depth metrics from data storage performance data describing data storage performance of the data storage equipment. The technique further involves performing a performance impact detection operation on the queue depth metrics to determine whether a performance impacting event has occurred on the data storage equipment. The technique further involves, in response to a result of the performance impact detection operation indicating that a performance impacting event has occurred on the data storage equipment, launching a set of performance impact operations to address the performance impacting event that occurred on the data storage equipment. Such a technique may be performed by an electronic apparatus coupled with the data storage equipment (e.g., over a network).

Disclosed is a method, apparatus, and system for performing proxy-based partition backup in a virtualized environment, the operations comprising: mounting a backup source virtual machine disk to a backup proxy; obtaining, at the backup proxy, partition information for a backup source partition on the backup source virtual machine disk; and reading, by the backup proxy, partition data of the backup source partition based on the partition information and backing up the partition data to a data store.

The disclosure provides an approach for zeroing allocated storage blocks of a file. The blocks are zeroed in the background, during a normal operation of a storage system, thus lowering the chance that the latency of a storage operation would be increased by the zeroing process. The approach also precludes a delay in being able to use the file, the delay caused by pre-zeroing the storage blocks prior to use of the file.