公开(公告)号：US20220317921A1

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

申请号：US17216869

申请日：2021-03-30

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.

公开(公告)号：US11216439B2

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

申请号：US16513362

申请日：2019-07-16

Applicant: NETAPP, INC.

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

IPC: G06F16/23 ,  G06F16/176

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.

公开(公告)号：US11157317B2

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

申请号：US16583977

申请日：2019-09-26

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.

公开(公告)号：US10417189B2

公开(公告)日：2019-09-17

申请号：US14928452

申请日：2015-10-30

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.