中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

55 records (took 0.022 seconds)

    File system format for persistent memory
    31.
    发明授权
    File system format for persistent memory 有权

    公开(公告)号：US11063601B1

    公开(公告)日：2021-07-13

    申请号：US16852586

    申请日：2020-04-20

    Applicant: NetApp Inc.

    Inventor： Ram Kesavan ,  Matthew Fontaine Curtis-Maury ,  Abdul Basit ,  Vinay Devadas ,  Ananthan Subramanian ,  Mark Smith

    IPC: H03M1/12 ,  H03M1/06 ,  G06F3/06 ,  G06F16/901

    Abstract: Techniques are provided for implementing a file system format for persistent memory. A node, with persistent memory, receives an operation associated with a file identifier and file system instance information. A list of file system info objects are evaluated to identify a file system info object matching the file system instance information. An inofile, identified by the file system info object as being associated with inodes of files within an instance of the file system targeted by the operation, is traversed to identify an inode matching the file identifier. If the inode has an indicator that the file is tiered into the persistent memory, then the inode it utilized to facilitate execution of the operation upon the persistent memory. Otherwise, the operation is routed to a storage file system tier for execution by a storage file system upon storage associated with the node.

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

    公开(公告)号：US11836363B2

    公开(公告)日：2023-12-05

    申请号：US17750793

    申请日：2022-05-23

    Applicant: NetApp Inc.

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

    IPC: G06F3/06

    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 MEMORY FILE SYSTEM RECONCILIATION
    35.
    发明公开
    PERSISTENT MEMORY FILE SYSTEM RECONCILIATION 审中-公开

    公开(公告)号：US20230251932A1

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

    申请号：US18302212

    申请日：2023-04-18

    Applicant: NetApp Inc.

    Inventor： Matthew Fontaine Curtis-Maury ,  Ram Kesavan ,  Ananthan Subramanian ,  Abdul Basit ,  Vinay Devadas ,  Yash Hetal Trivedi

    IPC: G06F11/14 ,  G06F13/16 ,  G06F16/182

    CPC classification number: G06F11/1435 ,  G06F13/1668 ,  G06F16/183

    Abstract: Techniques are provided for persistent memory file system reconciliation. As part of the persistent memory file system reconciliation, high level file system metadata associated with a persistent memory file system of persistent memory is reconciled. Client access to the persistent memory file system is inaccessible until reconciliation of the high level file system metadata has completed. A first scanner is executed to traverse pages of the persistent memory in order to fix local inconsistencies associated with the pages. A local inconsistency of a first set of metadata or data of a page is fixed using a second set of metadata or data of the page. The first scanner is executed asynchronously in parallel with processing client I/O directed to the persistent memory file system.

    FORWARDING OPERATIONS TO BYPASS PERSISTENT MEMORY
    36.
    发明申请
    FORWARDING OPERATIONS TO BYPASS PERSISTENT MEMORY 有权

    公开(公告)号：US20230139582A1

    公开(公告)日：2023-05-04

    申请号：US18089633

    申请日：2022-12-28

    Applicant: NetApp Inc.

    Inventor： Ananthan Subramanian ,  Matthew Fontaine Curtis-Maury ,  Vinay Devadas ,  Bulli Venkata Rajesh Vipperla

    IPC: G06F3/06 ,  G06F15/173

    Abstract: Techniques are provided for forwarding operations to bypass persistent memory. A modify operation, targeting an object, may be received at a persistent memory tier of a node. If a forwarding policy indicates that forwarding is not enabled for the modify operation and the target object, then the modify operation is executed through a persistent memory file system. If the forwarding policy indicates that forwarding is enabled for the modify operation and the target object, then the modify operation is forwarded to a file system tier as a forwarded operation for execution through a storage file system.

    Forwarding operations to bypass persistent memory
    37.
    发明授权
    Forwarding operations to bypass persistent memory 有权

    公开(公告)号：US11544007B2

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

    申请号：US17216869

    申请日：2021-03-30

    Applicant: NetApp Inc.

    Inventor： Ananthan Subramanian ,  Matthew Fontaine Curtis-Maury ,  Vinay Devadas ,  Bulli Venkata Rajesh Vipperla

    IPC: G06F12/00 ,  G06F3/06 ,  G06F15/173

    Abstract: Techniques are provided for forwarding operations to bypass persistent memory. A modify operation, targeting an object, may be received at a persistent memory tier of a node. If a forwarding policy indicates that forwarding is not enabled for the modify operation and the target object, then the modify operation is executed through a persistent memory file system. If the forwarding policy indicates that forwarding is enabled for the modify operation and the target object, then the modify operation is forwarded to a file system tier as a forwarded operation for execution through a storage file system.

    COORDINATING SNAPSHOT OPERATIONS ACROSS MULTIPLE FILE SYSTEMS
    38.
    发明申请
    COORDINATING SNAPSHOT OPERATIONS ACROSS MULTIPLE FILE SYSTEMS 有权

    公开(公告)号：US20220318188A1

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

    申请号：US17216940

    申请日：2021-03-30

    Applicant: NetApp Inc.

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

    IPC: G06F16/11

    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.

    SUPPORTING A LOOKUP STRUCTURE FOR A FILE SYSTEM IMPLEMENTING HIERARCHICAL REFERENCE COUNTING
    39.
    发明申请
    SUPPORTING A LOOKUP STRUCTURE FOR A FILE SYSTEM IMPLEMENTING HIERARCHICAL REFERENCE COUNTING 有权

    公开(公告)号：US20220107916A1

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

    申请号：US17060400

    申请日：2020-10-01

    Applicant: NetApp Inc.

    Inventor： Matthew Fontaine Curtis-Maury ,  Vinay Devadas ,  Yash Hetal Trivedi

    IPC: G06F16/14 ,  G06F3/06

    Abstract: Techniques are provided for supporting a lookup structure for a file system implementing hierarchical reference counting. A write operation to write data to a page maintained by the file system is received. A lookup within a lookup structure is performed using information related to the page in order to identify a lookup entry within the lookup structure. A hash generation count within the lookup entry is compared to a file system info generation count within a file system info object for a volume associated with the page. In response to the lookup entry generation count not matching the file system info generation count, a file system tree of the file system is traversed to determine a reference count for the page, and the write operation is implemented based upon the reference count. Otherwise, the lookup entry is utilized to access the page for processing the write operation.

    PERSISTENT MEMORY FILE SYSTEM RECONCILIATION
    40.
    发明申请
    PERSISTENT MEMORY FILE SYSTEM RECONCILIATION 有权

    公开(公告)号：US20220083422A1

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

    申请号：US17018176

    申请日：2020-09-11

    Applicant: NetApp Inc.

    Inventor： Matthew Fontaine Curtis-Maury ,  Ram Kesavan ,  Ananthan Subramanian ,  Abdul Basit ,  Vinay Devadas ,  Yash Hetal Trivedi

    IPC: G06F11/14 ,  G06F16/182 ,  G06F13/16

    Abstract: Techniques are provided for persistent memory file system reconciliation. As part of the persistent memory file system reconciliation, high level file system metadata associated with a persistent memory file system of persistent memory is reconciled. Client access to the persistent memory file system is inaccessible until reconciliation of the high level file system metadata has completed. A first scanner is executed to traverse pages of the persistent memory in order to fix local inconsistencies associated with the pages. A local inconsistency of a first set of metadata or data of a page is fixed using a second set of metadata or data of the page. The first scanner is executed asynchronously in parallel with processing client I/O directed to the persistent memory file system.

Patent Agency Ranking