ADDITIONAL COMPRESSION FOR EXISTING COMPRESSED DATA

    公开(公告)号:US20240128984A1

    公开(公告)日:2024-04-18

    申请号:US18448218

    申请日:2023-08-11

    Applicant: NetApp Inc.

    Abstract: Techniques are provided for implementing additional compression for existing compressed data. Format information stored within a data block is evaluated to determine whether the data block is compressed or uncompressed. In response to the data block being compressed according to a first compression format, the data block is decompressed using the format information. The data block is compressed with one or more other data blocks to create compressed data having a second compression format different than the first compression format.

    AUTO-HEALING SERVICE FOR INTELLIGENT DATA INFRASTRUCTURE

    公开(公告)号:US20240126636A1

    公开(公告)日:2024-04-18

    申请号:US18392831

    申请日:2023-12-21

    Applicant: NetApp, Inc.

    CPC classification number: G06F11/079 G06F11/0793 G06F11/3034

    Abstract: Systems and methods for automated remediation of issues arising in a data management storage system are provided. Deployed assets of a storage solution vendor may deliver telemetry data to the vendor on a regular basis. The received telemetry data may be processed by an AIOps platform to perform predictive analytics and arrive at “community wisdom” from the vendor's installed user base. In one embodiment, an insight-based approach is used to facilitate risk detection and remediation including proactively addressing issues before they turn into more serious problems. For example, based on continuous learning based on the community wisdom and making one or both of a rule set and a remediation set derived therefrom available for use by cognitive computing co-located with a customer's storage system, a risk to which the storage system is exposed may be determined and a corresponding remediation may be deployed to address or mitigate the risk.

    SYNCHRONOUS REPLICATION
    53.
    发明公开

    公开(公告)号:US20240126470A1

    公开(公告)日:2024-04-18

    申请号:US18448224

    申请日:2023-08-11

    Applicant: NetApp Inc.

    Abstract: One or more techniques and/or computing devices are provided for synchronous replication. For example, synchronous replication relationships are established between a first storage object (e.g., a file, a logical unit number (LUN), a consistency group, etc.), hosted by a first storage controller, and a plurality of replication storage objects hosted by other storage controllers. In this way, a write operation to the first storage object is implemented in parallel upon the first storage object and the replication storage objects in a synchronous manner, such as using a zero-copy operation to reduce overhead otherwise introduced by performing copy operations. Reconciliation is performed in response to a failure so that the first storage object and the replication storage objects comprise consistent data. Failed write operations and replication write operations are retried, while enforcing a single write semantic. Dependent write order consistency is enforced for dependent write operations, such as overlapping write operations.

    Combining data block I/O and checksum block I/O into a single I/O operation during processing by a storage stack

    公开(公告)号:US11954348B2

    公开(公告)日:2024-04-09

    申请号:US17716977

    申请日:2022-04-08

    Applicant: NetApp Inc.

    CPC classification number: G06F3/064 G06F3/0613 G06F3/0673

    Abstract: Techniques are provided for combining data block and checksum block I/O into a single I/O operation. Many storage systems utilize checksums to verify the integrity of data blocks stored within storage devices managed by a storage stack. However, when a storage system reads a data block from a storage device, a corresponding checksum must also be read to verify integrity of the data in the data block. This results in increased latency because two read operations are being processed through the storage stack and are being executed upon the storage device. To reduce this latency and improve I/O operations per second, a single combined I/O operation corresponding to a contiguous range of blocks including the data block and the checksum block is processed through the storage stack instead of two separate I/O operations. Additionally, I/O operation may be combined into a single request that is executed upon the storage device.

    BLOCK ALLOCATION FOR PERSISTENT MEMORY DURING AGGREGATE TRANSITION

    公开(公告)号:US20240103744A1

    公开(公告)日:2024-03-28

    申请号:US18528556

    申请日:2023-12-04

    Applicant: NetApp Inc.

    CPC classification number: G06F3/0631 G06F3/0604 G06F3/064 G06F3/065 G06F3/0679

    Abstract: Techniques are provided for block allocation for persistent memory during aggregate transition. In a high availability pair including first and second nodes, the first node makes a determination that control of a first aggregate is to transition from the first node to the second node. A portion of available free storage space is allocated from a first persistent memory of the first node as allocated pages within the first persistent memory. Metadata information for the allocated pages is updated with an identifier of the first aggregate to create updated metadata information reserving the allocated pages for the first aggregate. The updated metadata information is mirrored to the second node, so that the second node also reserves those pages. Control of the first aggregate is transitioned to the second node. As a result, the nodes do not attempt allocating the same free pages to different aggregates during a transition.

    Persistent key-value store and journaling system

    公开(公告)号:US11940911B2

    公开(公告)日:2024-03-26

    申请号:US17553930

    申请日:2021-12-17

    Applicant: NetApp Inc.

    Abstract: Techniques are provided for implementing a persistent key-value store for caching client data, journaling, and/or crash recovery. The persistent key-value store may be hosted as a primary cache that provides read and write access to key-value record pairs stored within the persistent key-value store. The key-value record pairs are stored within multiple chains in the persistent key-value store. Journaling is provided for the persistent key-value store such that incoming key-value record pairs are stored within active chains, and data within frozen chains is written in a distributed manner across distributed storage of a distributed cluster of nodes. If there is a failure within the distributed cluster of nodes, then the persistent key-value store may be reconstructed and used for crash recovery.

Patent Agency Ranking