中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

54 records (took 0.02 seconds)

    SUPPORTING A LOOKUP STRUCTURE FOR A FILE SYSTEM IMPLEMENTING HIERARCHICAL REFERENCE COUNTING
    11.
    发明申请
    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.

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

    DATA MANAGEMENT ACROSS A PERSISTENT MEMORY TIER AND A FILE SYSTEM TIER
    15.
    发明申请
    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
    16.
    发明申请
    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.

    AUTO-EXPIRING LOCKS BASED ON OBJECT STAMPING
    17.
    发明申请
    AUTO-EXPIRING LOCKS BASED ON OBJECT STAMPING 审中-公开

    公开(公告)号：US20190340162A1

    公开(公告)日：2019-11-07

    申请号：US16513362

    申请日：2019-07-16

    Applicant: NETAPP, INC.

    Inventor： Matthew Curtis-Maury ,  Aditya Kulkarni ,  Vinay Devadas

    IPC: G06F16/23

    Abstract: Presented herein are methods, non-transitory computer readable media, and devices for efficiently administering locks for shared resources, such as data blocks, stored on a storage system. Methods for stamping a plurality of computer data objects are disclosed which include: accessing at least one of the plurality of computer data objects by a first data thread; assigning, by the first data thread, a stamp to the at least one of the plurality of computer data objects, to signify the at least one of the plurality of computer data objects is associated with the first data thread; preventing subsequent access by a second data thread to the stamped at least one of the plurality of computer data objects; and determining the stamp is no longer active, upon an event, effectively releasing the at least one of the plurality of computer data objects.

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

    公开(公告)号：US12169472B2

    公开(公告)日：2024-12-17

    申请号：US18361966

    申请日：2023-07-31

    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.

    Hybrid Model Of Fine-Grained Locking And Data Partitioning
    19.
    发明申请
    Hybrid Model Of Fine-Grained Locking And Data Partitioning 有权

    公开(公告)号：US20240411726A1

    公开(公告)日：2024-12-12

    申请号：US18740944

    申请日：2024-06-12

    Applicant: NetApp, Inc.

    Inventor： Matthew Curtis-Maury ,  Vinay Devadas ,  Aditya Kulkarni

    IPC: G06F16/176 ,  G06F16/18

    Abstract: Presented herein are methods, non-transitory computer readable media, and devices for integrating a hybrid model of fine-grained locking and data-partitioning wherein fine-grained locking is added to existing systems that are based on hierarchical data-partitioning in order in increase parallelism with minimal code re-write. Methods for integrating a hybrid model of fine-grained locking and data-partitioning are disclosed which include: creating, by a network storage server, a plurality of domains for execution of processes of the network storage server, the plurality of domains including a domain; creating a hierarchy of storage filesystem subdomains within the domain, wherein each of the subdomains corresponds to one or more types of processes, wherein at least one of the storage filesystem subdomains maps to a data object that is locked via fine-grained locking; and assigning processes for simultaneous execution by the storage filesystem subdomains within the domain and the at least one subdomain that maps to the data object locked via fine-grained locking.

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

    公开(公告)号：US20240411645A1

    公开(公告)日：2024-12-12

    申请号：US18809170

    申请日：2024-08-19

    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

    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