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.

Abstract: A method is provided for use in a storage system to dynamically disable and enable prefetching, comprising: defining a first plurality of time windows; calculating a first plurality of weights; identifying a first plurality of values of a cache metric; calculating a prefetch score for a first type of data based on the first plurality of weights and the first plurality of caching metric values, the prefetch score being calculated by weighing each of the cache metric values based on a respective one of the first plurality of weights that corresponds to a same time window as the cache metric value; and when the prefetch score fails to meet a threshold, stopping prefetching of the first type of data, while continuing to prefetch a second type of data.

Abstract: A technique for storing data in a data storage system detects that a read is being performed pursuant to a data copy request. In response, the data storage system stores a digest of the data being read in an entry of a digest cache. Later, when a write pursuant to the same copy request arrives, the storage system obtains the entry from the digest cache and completes the write request without creating a duplicate copy of the data.

Abstract: A method of responding to requests to read data from a computerized data storage system is disclosed. The method includes (a) receiving a request to access a set of data stored in an extent of persistent storage of the computerized data storage system, (b) obtaining, from mapping metadata provided for locating the requested extent, a hash digest of the set of data, the hash digest identifying contents of the set of data, (c) indexing into a content-based cache within memory of the computerized data storage system with a key based on the hash digest to locate a cached copy of the set of data within the memory, and (d) returning the cached copy of the set of data from the memory without accessing the extent of data from persistent storage. An apparatus, system, and computer program product for performing a similar method are also provided.

Abstract: A method, computer program product, and computer system for receiving, at a computing device, an I/O request directed to a compressed data portion of a file system. A field associated with the compressed data portion may be determined to be invalid. An error may be generated in response to determining that the field associated with the compressed data portion is invalid. The file system may be maintained in an online status while the compressed data portion is invalid.

Abstract: A technique for storing data in a data storage system detects that a read is being performed pursuant to a data copy request. In response, the data storage system stores a digest of the data being read in an entry of a digest cache. Later, when a write pursuant to the same copy request arrives, the storage system obtains the entry from the digest cache and completes the write request without creating a duplicate copy of the data.

Abstract: A technique for managing a file system includes dividing the addressable space of a file system into multiple subspaces: a data subspace for user data; an inode subspace for inodes describing the user data; and an MDB (metadata block) subspace for indirect blocks and/or directory structures pertaining to the user data. In response to storage requests to write user files to the file system, the file system stores user data of the files in the data subspace, stores inodes pertaining to the user files in the inode subspace, and stores indirect blocks and/or directories in the MDB subspace.