公开(公告)号：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.

公开(公告)号：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.

公开(公告)号：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.

公开(公告)号：US11301430B2

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

申请号：US16562852

申请日：2019-09-06

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.

公开(公告)号：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.

公开(公告)号：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.

公开(公告)号：US20220083279A1

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

申请号：US17536571

申请日：2021-11-29

Applicant: NetApp Inc.

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

IPC: G06F3/06 ,  G06F11/14

Abstract: Techniques are provided for implementing write ordering for persistent memory. A set of actions are identified for commitment to persistent memory of a node for executing an operation upon the persistent memory. An episode is created to comprise a first subset of actions of the set of actions that can be committed to the persistent memory in any order with respect to one another such that a consistent state of the persistent memory can be reconstructed in the event of a crash of the node during execution of the operation. The first subset of actions within the episode are committed to the persistent memory and further execution of the operation is blocked until the episode completes.

公开(公告)号：US20220035717A1

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

申请号：US16944001

申请日：2020-07-30

Applicant: NetApp Inc.

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

IPC: G06F11/14 ,  G06F11/07 ,  G06F11/30 ,  G06F12/0817 ,  G06F12/0882 ,  G06F12/02

Abstract: Techniques are provided for maintaining and recomputing reference counts in a persistent memory file system of a node. Primary reference counts are maintained for pages within persistent memory of the node. In response to receiving a first operation to link a page into a persistent memory file system of the persistent memory, a primary reference count of the page is incremented before linking the page into the persistent memory file system. In response to receiving a second operation to unlink the page from the persistent memory file system, the page is unlinked from the persistent memory file system before the primary reference count is decremented. Upon the node recovering from a crash, the persistent memory file system is traversed in order to update shadow reference counts for the pages with correct reference count values, which are used to overwrite the primary reference counts with the correct reference count values.

公开(公告)号：US20210326065A1

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

申请号：US16852580

申请日：2020-04-20

Applicant: NetApp Inc.

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

IPC: G06F3/06 ,  G06F11/14

Abstract: Techniques are provided for implementing write ordering for persistent memory. A set of actions are identified for commitment to persistent memory of a node for executing an operation upon the persistent memory. An episode is created to comprise a first subset of actions of the set of actions that can be committed to the persistent memory in any order with respect to one another such that a consistent state of the persistent memory can be reconstructed in the event of a crash of the node during execution of the operation. The first subset of actions within the episode are committed to the persistent memory and further execution of the operation is blocked until the episode completes.

公开(公告)号：US10521269B2

公开(公告)日：2019-12-31

申请号：US15583932

申请日：2017-05-01

Applicant: NETAPP, INC.

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

IPC: G06F9/48 ,  G06F9/50

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for optimizing thread assignment to schedulers, avoid starvation of individual data partitions, and maximize parallelism in the presence of hierarchical data partitioning are disclosed, which include: partitioning, by a network storage server, a scheduler servicing a data partitioned system into a plurality of autonomous schedulers; determining what fraction of thread resources in the data partitioned system at least one of the plurality of autonomous schedulers is to receive; and determining, with minimal synchronization, when it is time to allow the at least one of the plurality of autonomous schedulers servicing a coarse hierarchy to run.