中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

55 records (took 0.024 seconds)

    FILE SYSTEM FORMAT FOR PERSISTENT MEMORY
    11.
    发明申请
    FILE SYSTEM FORMAT FOR PERSISTENT MEMORY 有权

    公开(公告)号：US20250038756A1

    公开(公告)日：2025-01-30

    申请号：US18914423

    申请日：2024-10-14

    Applicant: NetApp, Inc.

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

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

    Abstract: Techniques are provided for implementing a file system format for persistent memory. A node, comprising persistent memory, receives an operation comprising 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 comprises 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.

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

    公开(公告)号：US20240385991A1

    公开(公告)日：2024-11-21

    申请号：US18786742

    申请日：2024-07-29

    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.

    BLOCK ALLOCATION FOR PERSISTENT MEMORY DURING AGGREGATE TRANSITION
    14.
    发明公开
    BLOCK ALLOCATION FOR PERSISTENT MEMORY DURING AGGREGATE TRANSITION 审中-公开

    公开(公告)号：US20240103744A1

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

    申请号：US18528556

    申请日：2023-12-04

    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.

    Coordinating snapshot operations across multiple file systems
    17.
    发明授权
    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.

    Block allocation for persistent memory during aggregate transition
    18.
    发明授权
    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
    19.
    发明申请
    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
    20.
    发明申请
    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