Abstract: In at least one embodiment, techniques for resource regulation and scheduling can include: allocating a first amount of tokens denoting an amount of CPU resources available for executing background (BG) maintenance tasks; determining a distribution of the first amount of tokens among a plurality of CPU cores upon which BG maintenance tasks are allowed to execute; and scheduling, by a scheduler component, a first plurality of BG maintenance tasks for execution on the plurality of CPU cores in accordance with a plurality of averages and in accordance with the distribution, wherein each of the plurality of averages denotes an average number of tokens of CPU resources consumed to complete execution of a corresponding one of the first plurality of BG maintenance tasks of a particular BG maintenance task subtype.

Abstract: A method, computer program product, and computing system for tracing a variable set of deduplication metrics for one or more deduplication data sets, applying a regression-based machine learning (ML) model to the variable set of deduplication metrics, and generating a weighted deduplication score and a weighted compression score for each data sample. The method may further include selecting one or more of a compression algorithm and a deduplication parameter based on one or more of the weighted deduplication score and the weighted compression score. A flushing manager may be used to perform in-line deduplication on one or more selections of front-end IO write data and to apply one or more of the selected compression algorithm and the selected deduplication parameter.

Abstract: A technique for performing data-storage background activities includes maintaining a plurality of queues of background activities for respective types of background activities. The queues have a specified order based on a set of relationships between the types of background activities. The technique further includes allocating respective numbers of resource units to respective queues of the plurality of queues. The technique still further includes executing batches of background activities from the respective queues in the specified order for the respective numbers of resource units.

Abstract: A technique for performing data-storage background activities includes maintaining a plurality of queues of background activities for respective types of background activities. The queues have a specified order based on a set of relationships between the types of background activities. The technique further includes allocating respective numbers of resource units to respective queues of the plurality of queues. The technique still further includes executing batches of background activities from the respective queues in the specified order for the respective numbers of resource units.

Abstract: In at least one embodiment, processing can include: sending, from a host to a data storage system, a first storage reclamation command that identifies a first storage region of physical storage available for reclamation and reuse; in response to the data storage system receiving the first storage reclamation command, sending from the data storage system to the host first feedback information identifying at least a first detected condition on the data storage system; and in response to receiving the first feedback information at the host, the host varying a current rate or frequency of subsequent storage reclamation commands sent to the data storage system based, at least in part, on the first feedback information regarding the first detected condition on the data storage system.

Abstract: A technique for scheduling tasks in a storage system includes predicting excess capacity of processing resources over a known interval of time and determining a quantity of credit based on the predicted capacity. The technique further includes holding back a requested increase in the priority of one or more speed-noncritical tasks by consuming a portion of the credit and thus allowing one or more speed-critical tasks to run with undiminished access to the processing resources.

Abstract: In at least one embodiment, processing can include: partitioning a first set of CPU cores into a plurality of CPU core subsets each associated with a single corresponding one of a plurality of predefined I/O types; classifying each of a plurality of I/O requests as one of the plurality of predefined I/O types; for each of the plurality of I/O requests, selecting a CPU core from a first CPU core subset of the plurality of CPU core subsets based, at least in part, on the first CPU core subset having a corresponding one of the plurality of predefined I/O types that matches an associated one of the plurality of predefined I/O types of said each I/O request; and processing the plurality of I/O requests on their selected CPU cores.

Abstract: Per-core token pools and a shared token pool are provided, where each one of the per-core token pools corresponds to one of multiple processor cores. When the per-core token pool corresponding to the processor core used to process a received host I/O request contains at least the number of tokens required by the host I/O request, the tokens required by the host I/O request are allocated from that per-core token pool and the host I/O request is processed without accessing the shared token pool. The allocated tokens are returned to the per-core token pool until the tokens contained in the per-core target pool reaches a target quota for the per-core token pool. The remaining allocated tokens are returned to the shared token pool. Token imbalances may be addressed by periodically adjusting target quotas, and/or by allowing tokens to be dynamically allocated from another per-core token pool.

Abstract: In at least one embodiment, processing can include: partitioning a first set of CPU cores into a plurality of CPU core subsets each associated with a single corresponding one of a plurality of predefined I/O types; classifying each of a plurality of I/O requests as one of the plurality of predefined I/O types; for each of the plurality of I/O requests, selecting a CPU core from a first CPU core subset of the plurality of CPU core subsets based, at least in part, on the first CPU core subset having a corresponding one of the plurality of predefined I/O types that matches an associated one of the plurality of predefined I/O types of said each I/O request; and processing the plurality of I/O requests on their selected CPU cores.

Abstract: In at least one embodiment, processing can include: sending, from a host to a data storage system, a first storage reclamation command that identifies a first storage region of physical storage available for reclamation and reuse; in response to the data storage system receiving the first storage reclamation command, sending from the data storage system to the host first feedback information identifying at least a first detected condition on the data storage system; and in response to receiving the first feedback information at the host, the host varying a current rate or frequency of subsequent storage reclamation commands sent to the data storage system based, at least in part, on the first feedback information regarding the first detected condition on the data storage system.

Abstract: In at least one embodiment, techniques for resource regulation and scheduling can include: allocating a first amount of tokens denoting an amount of CPU resources available for executing background (BG) maintenance tasks; determining a distribution of the first amount of tokens among a plurality of CPU cores upon which BG maintenance tasks are allowed to execute; and scheduling, by a scheduler component, a first plurality of BG maintenance tasks for execution on the plurality of CPU cores in accordance with a plurality of averages and in accordance with the distribution, wherein each of the plurality of averages denotes an average number of tokens of CPU resources consumed to complete execution of a corresponding one of the first plurality of BG maintenance tasks of a particular BG maintenance task subtype.

Abstract: A data storage system continually monitors a loading level of processing requests from host computers relative to a predetermined threshold. In response to the loading level not exceeding the predetermined threshold, a first bulk operation request is responded to with a normal acknowledgment issued without a rate-managing delay. In response to the loading level exceeding the predetermined threshold, a third bulk operation request is responded to with a delayed acknowledgment issued with the rate-managing delay and thus delaying issuance by a requesting host of a subsequent fourth bulk operation request to a delayed time after the third bulk operation request. The use of the delayed acknowledgement throttles the rate of bulk operations and thus limits adverse performance impact to other, latency-sensitive operations such as regular read and write operations.

Abstract: A data storage system continually monitors a loading level of processing requests from host computers relative to a predetermined threshold. In response to the loading level not exceeding a predetermined threshold, a first identification request is responded to with a full response identifying all data blocks over a first complete range of a first bulk storage operation. In response to the loading level exceeding the predetermined threshold, a second identification request is responded to with a partial response identifying a subset of data blocks over only a portion of a second complete range of a second bulk storage operation. The partial response causes a host to first process the subset of data blocks and then send an additional identification request for additional blocks of the second complete range, effectively reducing the rate of bulk storage operations and their effect on other, latency-sensitive operations such as reads and writes.

Abstract: A technique for scheduling tasks in a storage system includes predicting excess capacity of processing resources over a known interval of time and determining a quantity of credit based on the predicted capacity. The technique further includes holding back a requested increase in the priority of one or more speed-noncritical tasks by consuming a portion of the credit and thus allowing one or more speed-critical tasks to run with undiminished access to the processing resources.

Abstract: A method, computer program product, and computing system for allocating a first number of tokens from a plurality of tokens for processing read IO requests from a read IO queue, thus defining a number of allocated read tokens. A second number of tokens may be allocated from the plurality of tokens for processing write IO requests from a write IO queue, thus defining a number of allocated write tokens. It may be determined that the processing of the write IO requests is throttled. In response to determining that the processing of the write IO requests from the write IO queue is throttled, a maximum allowable number of write tokens may be defined. Additional tokens may be allocated for processing the read IO requests from the read IO queue based upon, at least in part, the maximum allowable number of write tokens and the number of allocated write tokens.

Abstract: A method, computer program product, and computing system for allocating a first number of tokens from a plurality of tokens for processing read IO requests from a read IO queue, thus defining a number of allocated read tokens. A second number of tokens may be allocated from the plurality of tokens for processing write IO requests from a write IO queue, thus defining a number of allocated write tokens. It may be determined that the processing of the write IO requests is throttled. In response to determining that the processing of the write IO requests from the write IO queue is throttled, a maximum allowable number of write tokens may be defined. Additional tokens may be allocated for processing the read IO requests from the read IO queue based upon, at least in part, the maximum allowable number of write tokens and the number of allocated write tokens.

Abstract: A method, computer program product, and computing system for defining a token pool size for a storage system token pool associated with a storage system. An input/output (IO) processing load for the storage system may be determined. The token pool size for the storage system token pool associated with the storage system may be dynamically adjusted based upon, at least in part, one or more changes in the IO processing load determined for the storage system.

Abstract: A method, computer program product, and computer system for receiving an indication about an amount of background IOs a background scheduler is capable of performing on a plurality of applications, wherein the indication may be based upon, at least in part, one of host IO latency and a rate of the host IO latency being at one of a plurality of levels. One or more applications of the plurality of applications on which to perform the background IOs may be determined. The background IO applications to be performed on the one or more applications of the plurality of applications may be scheduled based upon, at least in part, one of the host IO latency and the rate of the host IO latency being at one of the plurality of levels.

Abstract: A method, computer program product, and computing system for defining a token pool size for a storage system token pool associated with a storage system. An input/output (IO) processing load for the storage system may be determined. The token pool size for the storage system token pool associated with the storage system may be dynamically adjusted based upon, at least in part, one or more changes in the IO processing load determined for the storage system.

Abstract: A method, computer program product, and computer system for receiving an indication about an amount of background IOs a background scheduler is capable of performing on a plurality of applications, wherein the indication may be based upon, at least in part, one of host IO latency and a rate of the host IO latency being at one of a plurality of levels. One or more applications of the plurality of applications on which to perform the background IOs may be determined. The background IO applications to be performed on the one or more applications of the plurality of applications may be scheduled based upon, at least in part, one of the host IO latency and the rate of the host IO latency being at one of the plurality of levels.