G06F3/0685

Optimizing storage device access based on latency

A first set of physical units of a storage device of a storage system is selected for performance of low latency access operations, wherein other access operations are performed by remaining physical units of the storage device. A determination as to whether a triggering event has occurred that causes a selection of a new set of physical units of the storage device for the performance of low latency access operations is made. A second set of physical units of the storage device is selected for the performance of low latency access operations upon determining that the triggering event has occurred.

Tier-Specific Data Compression
20230032590 · 2023-02-02 ·

A method, apparatus, and computer program product for tier-specific data compression, comprising comparing costs associated with a plurality of storage configurations for storing data based on one or more usage characteristics of data, wherein each storage configuration of the plurality of storage configurations corresponds to a particular storage tier of a plurality of storage tiers and a particular compression algorithm of a plurality of compression algorithms and based on the comparison of the costs, storing the data using a storage configuration of the plurality of storage configurations.

Storage system with selectable write paths

A storage system has a first memory, and a second memory that includes storage memory. The storage system has a processing device. The processing device is to select whether to write data to the first memory and write the data from the first memory to the second memory, or to write the data to the second memory bypassing the first memory. The processing device is to write portions of data for storage according to such selection.

COMPUTER SYSTEM WITH DATA STORAGE TRANSFER RECOMMENDATION

A computer system is provided, including a first data storage with a first retrieval latency, a second data storage with a second retrieval latency that is higher than the first retrieval latency, and a processor coupled to a memory that stores instructions, which cause the processor to store a series of recovery points of a data collection in the first data storage. For a current recovery point of the series of recovery points, the processor is further configured to compute a difference between an incremental changed block value of one or more prior recovery points and a number of memory blocks inherited from the one or more prior recovery points. The processor generates and outputs a storage transfer recommendation to store a subset of the one or more of the prior recovery points in the second data storage rather than the first data storage, based on the computed difference.

RECALLING FILES FROM TAPE

Embodiments are disclosed for a method. The method includes migrating a file to a newer tape. The file is previously recalled by a linear tape file system (LTFS) from an older tape. The method also includes updating a stub for the file with metadata describing the newer tape, the older tape, and the file. Further, the method includes recalling the file using a tape selected from a plurality of potential tapes identified by the metadata.

MACHINE LEARNING TO IMPROVE CACHING EFFICIENCY IN A STORAGE SYSTEM
20220350484 · 2022-11-03 · ·

A system and method improve caching efficiency in a data storage system by performing machine learning processes on metadata relating to extents of data blocks, rather than individual blocks themselves. Thus, once the storage devices are divided into extents, various metadata regarding access to the blocks within each extent are aggregated, and per-extent features are extracted. These features are used to train a data regression model that is subsequently used to infer a most likely “hotness” value for each extent at a future time. These predicted values, which may be further classified as e.g. “hot”, “warm”, and “cold” using thresholds, are used to implement the cache replacement policy. Embodiments scale to large and multi-layered caches, and may avoid common caching problems like thrashing, by adjusting the extent size. Policy goal functions may be optimized by dynamically adjusting the classification thresholds.

DATA STORAGE DEVICE REDEPLOYMENT
20230090277 · 2023-03-23 · ·

Systems and methods are disclosed for data storage redeployment. For example, a controller of a data storage array can implement a process to determine when, or if, to redeploy a data storage device from a first data storage usage or tier having a first performance requirement to a second data storage usage or tier having a second performance requirement. In some embodiments, the first data storage tier performance requirement is for hot-data storage, and the second data storage tier performance requirement is for cold-data storage. Various criterion (e.g., a data storage device performance metric) threshold, such as a workload (e.g., LBAs written, LBAs read, or both) of the data storage device or bit error rate (BER), may be utilized in a redeployment determination.

IMAGE SEGMENT STORAGE AMONG ONE OR MORE STORAGE TIERS
20230088347 · 2023-03-23 ·

Examples described herein relate to a system that prior to execution of a virtualized execution environment on a compute node, store at least one image block into at least one tier of storage of a hierarchical storage system based on priority of the at least one image block. In some examples, the at least one image block comprises at least one portion of an image of the virtualized execution environment.

SITE RESILIENCY ON STRETCHED CLUSTERS
20230088529 · 2023-03-23 ·

A method for dynamic fault tolerance in a stretched storage cluster is provided. Embodiments include determining that data of a storage object is unavailable on a first site in a multi-site storage cluster comprising: the first site; a second site; and a witness node. Embodiments include modifying a voting arrangement for the storage object so that votes from the second site can achieve a quorum without any votes from the first site or the witness node. Embodiments include determining that the witness node is unavailable. Embodiments include, after determining that the witness node is unavailable, allowing data to be read from or written to one or more entities of the second site based on the quorum being achieved.

Congestion mitigation in a distributed storage system

A system comprises a plurality of computing devices that are communicatively coupled via a network and have a file system distributed among them, and comprises one or more file system request buffers residing on one or more of the plurality of computing devices. File system choking management circuitry that resides on one or more of the plurality of computing devices is operable to separately control: a first rate at which a first type of file system requests (e.g., one of data requests, data read requests, data write requests, metadata requests, metadata read requests, and metadata write requests) are fetched from the one or more buffers, and a second rate at which a second type of file system requests (e.g., another of data requests, data read requests, data write requests, metadata requests, metadata read requests, and metadata write requests) are fetched from the one or more buffers.