Each storage controller comprises a first storage unit, an interface unit, and a processing unit which sends, to the interface unit, a parameter which instructs n-fold write of writing data in each of n-number of (n is a natural number of 2 or more) other storage controllers. When the interface unit receives the parameter, the interface unit executes each processing of acquiring the data from the first storage unit and storing the data in the second storage unit, generating n-number of requests of writing the data in each of n-number of the other storage controllers, storing each of the generated requests in n-number of the queues corresponding to each of n-number of the other storage controllers, and processing each request stored in each queue and transferring the data stored in the second storage unit to each of n-number of the other storage controllers.

In a storage system such as a SAN, NAS, or storage array that implements hierarchical performance tiers based rated drive access latency, on-drive compression is used on data stored on a first tier and off-drive compression is used on data stored on a second tier. Off-drive compression is more processor intensive and may introduce some data access latency but reduces storage requirements. On-drive compression is performed at or near line speed but generally yields lower size reduction ratios than off-drive compression. On-drive compression may be implemented at a higher performance tier whereas off-drive compression may be implemented at a lower performance tier. Further, space saving realized from on-drive compression may be applied to over-provisioning.

Techniques for managing sequencing requests for storage node operations based on types of operations being sequenced. The techniques manage sequencing requests for different types of operations, such as backup and recovery operations, replication operations, migration operations, and so on, in a manner that avoids overwhelming storage node capacity. The techniques include receiving a sequencing request for an operation of a specified operation type at a request manager of a storage node and determining whether a capacity of the storage node is available for running the operation by a capacity manager for the specified operation type, in which the capacity manager is provided by a storage client and implemented on the storage node separate from the request manager. In this way, throttling, limiting, and/or prioritization requirements of the operation of the specified operation type can be defined by the storage client in a manner agnostic to the request manager.

An illustrative method includes a storage management system ingesting a data item into a unified storage system via a storage system interface among a plurality of storage system interfaces associated with the unified storage system, determining, in response to the ingesting of the data item into the unified storage system, an operation based on the data item, and providing a notification of the operation to an orchestration system configured to manage an execution of the operation by a computing system associated with the unified storage system. In certain embodiments, the unified storage system may be implemented as compute-aware storage system such as a container orchestrator-aware storage system.

In an approach for generating differentiated workload telemetry data, a processor corresponds one or more services with a workload related telemetry generating an event emitter. A processor performs a correlation analysis of corresponding relationship and connection among connected resources and current traffic into and out of the one or more services. A processor labels domain context for each telemetry event. A processor communicates each telemetry event to a global event handler. A processor performs a cross-correlation in real-time of telemetry data with the global event handler. A processor updates a real-time differentiated workload report.

A computer-implemented method includes receiving a request to provision a set of storage volumes for a server cluster, wherein the request includes an identifier for the server cluster and generating a provisioning work ticket for each storage volume in the set of storage volumes, each provisioning work ticket including the identifier for the server cluster. The provisioning work tickets are provided to a message broker. Multiple volume provisioning instances are executed such that at least two of the volume provisioning instances operate in parallel with each other and such that each volume provisioning instance receives a respective provisioning work ticket from the message broker and attempts to provision a respective storage volume of the set of storage volumes for the server cluster in response to receiving the volume provisioning work ticket.

In an embodiment, a data processing method comprises detecting an approval of a change to an electronic configuration document that symbolically identifies one or more configurations of users, groups, and/or permissions relating to access to computer program artifacts that are stored in a first repository of a geographically distributed, replicated artifact repository system; the artifact repository system comprising one or more second repositories that are geographically remote with respect to the first repository and which replicate the first repository; in response to the detecting: obtaining the electronic configuration document and deriving, based on the electronic configuration document, a plurality of regional repository settings values for users, groups, and/or permissions relating to access to the computer program artifacts and for the one or more second repositories; transmitting the one or more settings values to the one or more second repositories and causing injection of the one or more settings values into one or more repository configuration settings of the second repositories.

Systems and methods are described for enabling garbage collection on data storage systems. Traditional garbage collection often attempts to track use of data items on an individual level, deleting each item when it is no longer used. In distributed systems, tracking use on an individual level is difficult, and may require centralized knowledge across the system with respect to individual data items. Provided herein is a “coarse-grained” garbage collection mechanism, which divides objects into logical groups referred to as “roots.” Each root has a life cycle. While active, new data can be stored in a root. While inactive, use of data within a root can cause that date to be copied to a different, active root. When the system detects that data hasn't been used in an inactive root for a threshold period, the root can be considered “dead” and data within the root may be deleted.

In some examples, a computing system receives an indication of an increased workload portion to be added to a workload of a storage system, the workload comprising buckets of operations of different characteristics. The computing system computes, based on quantities of operations of the different characteristics in the workload, factor values that indicate distribution of operations of the increased workload portion to the buckets of operations of the different characteristics, and distributes, according to the factor values, the operations of the increased workload portion into the buckets of operations of the different characteristics.

A method for determining a storage location includes one or more processing modules of one or more computing devices of a storage network (SN) receiving a data object to store in a storage network (SN) and determining whether the data object is subject to a legal restriction, where a data object is subject to a legal restriction based on the data object requiring storage in a jurisdiction that subjects the data object to a retention policy. The method continues by determining one or more attributes of a first storage location of a plurality of storage locations and based on a determination that the data object is subject to a legal restriction and at least one attribute of the one or more attributes of the first storage location, transmitting a write threshold number of write requests to a plurality of SUs at the first storage location.