中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

167 records (took 0.024 seconds)

    OBJECT FORMAT RESILIENT TO REMOTE OBJECT STORE ERRORS
    43.
    发明公开
    OBJECT FORMAT RESILIENT TO REMOTE OBJECT STORE ERRORS 审中-公开

    公开(公告)号：US20230289258A1

    公开(公告)日：2023-09-14

    申请号：US18165077

    申请日：2023-02-06

    Applicant: NetApp Inc.

    Inventor： Ananthan Subramanian ,  Ganga Bhavani Kondapalli ,  Cheryl Marie Thompson ,  Kevin Danil Varghese ,  Anil Paul Thoppil ,  Qinghua Zheng

    IPC: G06F11/10 ,  G06F12/08 ,  G06F3/06 ,  G06F16/178

    CPC classification number: G06F11/1004 ,  G06F3/0619 ,  G06F12/08 ,  G06F16/178

    Abstract: Techniques are provided for remote object store error handling. A storage system may store data within one or more tiers of storage, such as a local storage tier (e.g., solid state storage and disks maintained by the storage system), a remote object store (e.g., storage provided by a third party storage provider), and/or other storage tiers. Because the remote object store may not provide the same data consistency and guarantees that the storage system provides for clients such as through the local storage tier, additional validation is provided by the storage system for the remote object store. For example, when data is put into an object of the remote object store, a verification get operation is performed to read and validate information within a header of the object. Other verifications and checks are performed such as using a locally stored metafile to detect corrupt or lost metadata and/or objects.

    Coordinating snapshot operations across multiple file systems
    44.
    发明授权
    Coordinating snapshot operations across multiple file systems 有权

    公开(公告)号：US11714782B2

    公开(公告)日：2023-08-01

    申请号：US17216940

    申请日：2021-03-30

    Applicant: NetApp Inc.

    Inventor： Ananthan Subramanian ,  Matthew Fontaine Curtis-Maury ,  Ram Kesavan ,  Rupa Natarajan ,  Vinay Devadas

    IPC: G06F16/11

    CPC classification number: G06F16/128

    Abstract: Techniques are provided for coordinating snapshot operations across multiple file systems. A notification may be received that a snapshot of data stored across a persistent memory file system and a storage file system is to be generated. Forwarding, of modify operations from a persistent memory tier to a file system tier for execution through the storage file system, may be enabled. Framing may be initiated to notify the storage file system of blocks within the persistent memory file system that comprise more up-to-date data than corresponding blocks within the storage file system. In response to the framing completing, a consistency point operation is performed to create the snapshot and to create a snapshot image as part of the snapshot.

    Object format resilient to remote object store errors
    45.
    发明授权
    Object format resilient to remote object store errors 有权

    公开(公告)号：US11573855B2

    公开(公告)日：2023-02-07

    申请号：US17582221

    申请日：2022-01-24

    Applicant: NetApp Inc.

    Inventor： Ananthan Subramanian ,  Ganga Bhavani Kondapalli ,  Cheryl Marie Thompson ,  Kevin Daniel Varghese ,  Anil Paul Thoppil ,  Qinghua Zheng

    IPC: G06F11/10 ,  G06F12/08 ,  G06F3/06 ,  G06F16/178

    Abstract: Techniques are provided for remote object store error handling. A storage system may store data within one or more tiers of storage, such as a local storage tier (e.g., solid state storage and disks maintained by the storage system), a remote object store (e.g., storage provided by a third party storage provider), and/or other storage tiers. Because the remote object store may not provide the same data consistency and guarantees that the storage system provides for clients such as through the local storage tier, additional validation is provided by the storage system for the remote object store. For example, when data is put into an object of the remote object store, a verification get operation is performed to read and validate information within a header of the object. Other verifications and checks are performed such as using a locally stored metafile to detect corrupt or lost metadata and/or objects.

    Distributed File System with Reduced Write and Read Latencies
    46.
    发明申请
    Distributed File System with Reduced Write and Read Latencies 有权

    公开(公告)号：US20220391361A1

    公开(公告)日：2022-12-08

    申请号：US17449760

    申请日：2021-10-01

    Applicant: NetApp, Inc.

    Inventor： Ananthan Subramanian ,  Daniel McCarthy ,  Arindam Banerjee

    IPC: G06F16/182 ,  G06F16/188 ,  G06F16/16

    Abstract: A method for reducing write latency in a distributed file system. A write request that includes a volume identifier is received at a data management subsystem deployed on a node within a distributed storage system. The data management subsystem maps the volume identifier to a file system volume and maps the file system volume to a set of logical block addresses in a logical block device in a storage management subsystem deployed on the node. The storage management subsystem maps the logical block device to a metadata object for the logical block device on the node that is used to process the write request. The mapping of the file system volume to the set of logical block addresses in the logical block device enables co-locating the metadata object with the file system volume on the node, which reduces the write latency associated with processing the write request.

    Multi-tier destaging write allocation
    47.
    发明授权
    Multi-tier destaging write allocation 有权

    公开(公告)号：US11354049B2

    公开(公告)日：2022-06-07

    申请号：US16679914

    申请日：2019-11-11

    Applicant: NetApp Inc.

    Inventor： Ganga Bhavani Kondapalli ,  Kevin Daniel Varghese ,  Ananthan Subramanian ,  Cheryl Marie Thompson ,  Anil Paul Thoppil

    IPC: G06F3/06

    Abstract: Techniques are provided for multi-tier write allocation. A storage system may store data within a multi-tier storage environment comprising a first storage tier (e.g., storage devices maintained by the storage system), a second storage tier (e.g., a remote object store provided by a third party storage provider), and/or other storage tiers. A determination is made that data (e.g., data of a write request received by the storage system) is to be stored within the second storage tier. The data is stored into a staging area of the first storage tier. A second storage tier location identifier, for referencing the data according to a format utilized by the second storage tier, is assigned to the data and provided to a file system hosting the data. The data is then destaged from the staging area into the second storage tier, such as within an object stored within the remote object store.

    Block allocation for persistent memory during aggregate transition
    48.
    发明授权
    Block allocation for persistent memory during aggregate transition 有权

    公开(公告)号：US11340804B2

    公开(公告)日：2022-05-24

    申请号：US16911425

    申请日：2020-06-25

    Applicant: NetApp Inc.

    Inventor： Abdul Basit ,  Ananthan Subramanian ,  Ram Kesavan ,  Matthew Fontaine Curtis-Maury

    IPC: G06F3/06

    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.

    DATA MANAGEMENT ACROSS A PERSISTENT MEMORY TIER AND A FILE SYSTEM TIER
    49.
    发明申请
    DATA MANAGEMENT ACROSS A PERSISTENT MEMORY TIER AND A FILE SYSTEM TIER 有权

    公开(公告)号：US20220035524A1

    公开(公告)日：2022-02-03

    申请号：US16942398

    申请日：2020-07-29

    Applicant: NetApp Inc.

    Inventor： Ananthan Subramanian ,  Matthew Fontaine Curtis-Maury ,  Ram Kesavan ,  Vinay Devadas

    IPC: G06F3/06 ,  G06F9/448 ,  G06F9/30 ,  G06F11/07

    Abstract: Techniques are provided for data management across a persistent memory tier and a file system tier. A block within a persistent memory tier of a node is determined to have up-to-date data compared to a corresponding block within a file system tier of the node. The corresponding block may be marked as a dirty block within the file system tier. Location information of a location of the block within the persistent memory tier is encoded into a container associated with the corresponding block. In response to receiving a read operation, the location information is obtained from the container. The up-to-date data is retrieved from the block within the persistent memory tier using the location information for processing the read operation.

    LOW-OVERHEAD ATOMIC WRITES FOR PERSISTENT MEMORY
    50.
    发明申请
    LOW-OVERHEAD ATOMIC WRITES FOR PERSISTENT MEMORY 有权

    公开(公告)号：US20210326266A1

    公开(公告)日：2021-10-21

    申请号：US16852589

    申请日：2020-04-20

    Applicant: NetApp Inc.

    Inventor： Matthew Fontaine Curtis-Maury ,  Vinay Devadas ,  Ananthan Subramanian ,  Ram Kesavan

    IPC: G06F12/0882 ,  G06F12/0871 ,  G06F12/02 ,  G06F16/22 ,  G06F16/182

    Abstract: Techniques are provided for atomic writes for persistent memory. In response to receiving a write operation, a new per-page structure with a new page block number is allocated. New data of the write operation is persisted to a new page of the persistent memory having the new page block number, and the new per-page structure is persisted to the persistent memory. If the write operation targets a hole after the new data and the new per-page structure have been persisted, then a new per-page structure identifier of the new per-page structure is inserted into a parent indirect page of a page comprising the new data. If the write operation targets old data after the new data and the new per-page structure have been persisted, then an old per-page structure of the old data is updated with the new page block number.

Patent Agency Ranking