-
公开(公告)号:US20170124123A1
公开(公告)日:2017-05-04
申请号:US14928481
申请日:2015-10-30
Applicant: NetApp, Inc.
Inventor: Matthew CURTIS-MAURY , Aditya KULKARNI , Vinay DEVADAS
IPC: G06F17/30
CPC classification number: G06F16/2308
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.
-
公开(公告)号:US20220229815A1
公开(公告)日:2022-07-21
申请号:US17717294
申请日:2022-04-11
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.
-
公开(公告)号:US20200019437A1
公开(公告)日:2020-01-16
申请号:US16583977
申请日:2019-09-26
Applicant: NetApp Inc.
Inventor: Vinay DEVADAS , Matthew CURTIS-MAURY , Aditya KULKARNI
IPC: G06F9/48
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.
-
公开(公告)号:US20190391963A1
公开(公告)日:2019-12-26
申请号: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.
-
公开(公告)号:US20180314551A1
公开(公告)日:2018-11-01
申请号:US15583932
申请日:2017-05-01
Applicant: NETAPP, INC.
Inventor: Vinay DEVADAS , Matthew CURTIS-MAURY , Aditya KULKARNI
IPC: G06F9/48
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.
-
公开(公告)号:US20170185304A1
公开(公告)日:2017-06-29
申请号:US14757430
申请日:2015-12-23
Applicant: NetApp, Inc.
Inventor: Matthew CURTIS-MAURY , Ram KESAVAN
IPC: G06F3/06
CPC classification number: G06F3/0605 , G06F3/061 , G06F3/0631 , G06F3/0644 , G06F3/0653 , G06F3/067 , G06F17/30
Abstract: Methods, non-transitory computer readable media, and devices for dynamically changing a number of partitions at runtime in a hierarchical data partitioning model include determining a number of coarse mapping objects, determining a number of fine mapping objects, and setting a number of coarse partitions and a number of fine partitions based on the determined number of coarse mapping object and the determined number of fine mapping objects.
-
公开(公告)号:US20170124109A1
公开(公告)日:2017-05-04
申请号:US14928452
申请日:2015-10-30
Applicant: NetApp, Inc.
Inventor: Matthew CURTIS-MAURY , Vinay DEVADAS , Aditya KULKARNI
IPC: G06F17/30
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.
-
-
-
-
-
-