-
公开(公告)号：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.
-
公开(公告)号：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.
-
公开(公告)号：US20190286717A1
公开(公告)日：2019-09-19
申请号：US15921260
申请日：2018-03-14
Applicant: NetApp, Inc.
Inventor： Nikhil Mattankot , Bharadwaj V. R. , Manish Katiyar , Aditya Kulkarni , Daniel Ting , Asif Pathan
IPC: G06F17/30
Abstract: Methods, non-transitory computer readable media, and computing devices that accelerate data access requests. With this technology, a hierarchy of a objects is inserted into a location database. Each of at least a subset of the objects comprises a physical storage location for data stored in a filesystem. One or more of the objects includes an object version number and a parent version number of a parent one of the objects. A determination is made when an invalidation event has occurred in the filesystem. The invalidation event is associated with one of the objects. The object version number for the one of the objects is modified to invalidate one or more of the subset of the objects, when the determining indicates that the invalidation event has occurred in the filesystem.
-
公开(公告)号：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.
-
公开(公告)号：US10936540B2
公开(公告)日：2021-03-02
申请号：US15921260
申请日：2018-03-14
Applicant: NetApp, Inc.
Inventor： Nikhil Mattankot , Bharadwaj V. R. , Manish Katiyar , Aditya Kulkarni , Daniel Ting , Asif Pathan
Abstract: Methods, non-transitory computer readable media, and computing devices that accelerate data access requests. With this technology, a hierarchy of a plurality of objects is inserted into a location database. Each of at least a subset of the plurality of objects comprises a physical storage location for data stored in a filesystem. One or more of the plurality of objects includes an object version number and a parent version number of a parent one of the plurality of objects. A determination is made when an invalidation event has occurred in the filesystem. The invalidation event is associated with one of the plurality of objects. The object version number for the one of the plurality of objects is modified to invalidate one or more of the subset of the objects, when the determining indicates that the invalidation event has occurred in the filesystem.
-
Patent Agency Ranking
公开(公告)号：US10521269B2
公开(公告)日：2019-12-31
申请号：US15583932
申请日：2017-05-01
Applicant: NETAPP, INC.
Inventor： Vinay Devadas , Matthew Curtis-Maury , Aditya Kulkarni
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.
-
公开(公告)号：US10452633B2
公开(公告)日：2019-10-22
申请号：US14928481
申请日：2015-10-30
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.
-
公开(公告)号：US12099872B2
公开(公告)日：2024-09-24
申请号：US17509034
申请日：2021-10-24
Applicant: NetApp Inc.
Inventor： Vinay Devadas , Matthew Curtis-Maury , Aditya Kulkarni
CPC classification number: G06F9/4887 , G06F9/5005
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.
-
公开(公告)号：US12013818B2
公开(公告)日：2024-06-18
申请号：US17717294
申请日：2022-04-11
Applicant: NetApp Inc.
Inventor： Matthew Curtis-Maury , Vinay Devadas , Aditya Kulkarni
IPC: G06F16/176 , G06F16/18
CPC classification number: G06F16/1774 , G06F16/1858
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.
-
公开(公告)号：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.
-
-
-
-
-
-
-
-
-
Search Results
12
records
(took 0.018 seconds)
