-
公开(公告)号：US20170344282A1
公开(公告)日：2017-11-30
申请号：US15167924
申请日：2016-05-27
Applicant: NetApp, Inc.
Inventor： Ram Kesavan , Ananthan Subramanian , Hiroshi Ishii , Abdul Basit , Joseph Brown, JR. , Rohit Singh
IPC: G06F3/06
Abstract: A method, non-transitory computer readable medium and storage server computing device that determines when a generated storage operation corresponds with one of a set of predefined storage operations. The storage operation is executed and a result of the execution of the storage operation is withheld from a file system, when the determining indicates that the storage operation corresponds with one of the set of predefined storage operations. A determination is made when a consistency point operation has completed. The result of the execution of the storage operation is presented to the file system, when the determining indicates that a consistency point operation has completed. This technology reduces the number of storage operations that are required to be journaled to maintain consistency of a file system, thereby reducing the runtime resources required to facilitate the journaling and replay resource required to replay the storage operations in a journal following a recovery.
-
公开(公告)号：US20250047575A1
公开(公告)日：2025-02-06
申请号：US18921168
申请日：2024-10-21
Applicant: NetApp, Inc.
Inventor： Abdul Basit , Daniel McCarthy , Christopher Lee Cason , Jian Hu
IPC: H04L41/5067 , G06F9/50
Abstract: Techniques are provided for dynamically implementing quality of service policies using a configurable quality of service provider pipeline. A quality of service policy is defined for throttling I/O operations received by a node based upon whether resources of the node have become over utilized. The quality of service policy is used to dynamically construct a quality of service provider pipeline with select quality of service providers that improve the ability to efficiently utilize resources compared to conventional static polices that cannot adequately react to changing considerations and resource utilization/saturation. With conventional static policies, an administrator manually defines a minimum amount of guaranteed resources and/or a maximum resource usage cap that could be set to values that result in inefficient operation and resource starvation. Dynamically constructing and utilizing the quality of service provider pipeline results in more efficient operation and mitigates resource starvation.
-
公开(公告)号：US12153504B2
公开(公告)日：2024-11-26
申请号：US18089192
申请日：2022-12-27
Applicant: NetApp Inc.
Inventor： Yash Hetal Trivedi , Daniel McCarthy , Ananthan Subramanian , William Arthur Gutknecht , Kevin Daniel Varghese , Swaroop Vikram Choudhari , Abdul Basit , Christopher Clark Corey , Chad Edmund Schneider
Abstract: Techniques are provided for failing over an aggregate from one file system instance to a different file system instance of a distributed scale-out storage system. The aggregate may be stored within distributed storage that is accessible to a plurality of file system instances of the distributed scale-out storage system. When the aggregate is failed over from a first file system instance to a second file system instance, the first file system instance may still have a valid read lease that allows the first file system instance to serve client I/O, directed to the aggregate, using a cache. In order to prevent the first file system instance from serving stale data from the cache before the read lease expires, state machines and a set of control data are used to ensure that the second file system instance attaches to the aggregate only after the read lease has expired.
-
公开(公告)号：US12141481B2
公开(公告)日：2024-11-12
申请号：US18513894
申请日：2023-11-20
Applicant: NetApp Inc.
Inventor： Ram Kesavan , Matthew Fontaine Curtis-Maury , Abdul Basit , Vinay Devadas , Ananthan Subramanian
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.
-
公开(公告)号：US12135880B1
公开(公告)日：2024-11-05
申请号：US18307097
申请日：2023-04-26
Applicant: NetApp Inc.
Inventor： Abdul Basit , Daniel McCarthy , Christopher Lee Cason , Jian Hu
IPC: G06F3/06
Abstract: Techniques are provided for dynamically implementing quality of service policies for a distributed storage system based upon resources saturation. A quality of service policy is defined for throttling I/O operations received by a node of the distributed storage system based upon whether resources of the node have become saturated. The quality of service policy is dynamically implemented based upon ever changing resource utilization and saturation. Dynamically implementing the quality of service policy improves the ability to efficiently utilize resources of the node compared to conventional static polices that cannot adequately react to such changing considerations and resource utilization/saturation. With conventional static policies, an administrator manually defines a minimum amount of guaranteed resources and/or a maximum resource usage cap that could be set to values that result in inefficient operation and resource starvation. Dynamically implementing the quality of service policy results in more efficient operation and mitigates resource starvation.
-
Patent Agency Ranking
公开(公告)号：US12119836B2
公开(公告)日：2024-10-15
申请号：US18186657
申请日：2023-03-20
Applicant: NetApp Inc.
Inventor： Ram Kesavan , Matthew Fontaine Curtis-Maury , Abdul Basit , Vinay Devadas , Ananthan Subramanian , Mark Smith
IPC: H03M1/12 , G06F3/06 , G06F16/901 , H03M1/06
CPC classification number: H03M1/0687 , G06F3/0604 , G06F3/0653 , G06F3/0685 , G06F16/9027 , H03M1/0695
Abstract: Techniques are provided for compacting indirect blocks. For example, an object is represented as a structure including data blocks within which data of the object is stored and indirect blocks including block numbers of where the data blocks are located in storage. Block numbers within a set of indirect blocks are compacted into a compacted indirect block including a base block number, a count of additional block numbers after the base block number in the compacted indirect block, and a pattern of the block numbers in the compacted indirect block. The compacted indirect block is stored into memory for processing access operations to the object. Storing compacted indirect blocks into memory allows for more block numbers to be stored within memory.
-
公开(公告)号：US20240118981A1
公开(公告)日：2024-04-11
申请号：US18089192
申请日：2022-12-27
Applicant: NetApp Inc.
Inventor： Yash Hetal Trivedi , Daniel McCarthy , Ananthan Subramanian , William Arthur Gutknecht , Kevin Daniel Varghese , Swaroop Vikram Choudhari , Abdul Basit , Christopher Clark Corey , Chad Edmund Schneider
CPC classification number: G06F11/2025 , G06F11/1662
Abstract: Techniques are provided for failing over an aggregate from one file system instance to a different file system instance of a distributed scale-out storage system. The aggregate may be stored within distributed storage that is accessible to a plurality of file system instances of the distributed scale-out storage system. When the aggregate is failed over from a first file system instance to a second file system instance, the first file system instance may still have a valid read lease that allows the first file system instance to serve client I/O, directed to the aggregate, using a cache. In order to prevent the first file system instance from serving stale data from the cache before the read lease expires, state machines and a set of control data are used to ensure that the second file system instance attaches to the aggregate only after the read lease has expired.
-
公开(公告)号：US20220283718A1
公开(公告)日：2022-09-08
申请号：US17750793
申请日：2022-05-23
Applicant: NetApp Inc.
Inventor： Abdul Basit , Ananthan Subramanian , Ram Kesavan , Matthew Fontaine Curtis-Maury
IPC: G06F3/06
Abstract: Techniques are provided for block allocation for persistent memory during aggregate transition. In a high availability pair including first and second nodes, the first node makes a determination that control of a first aggregate is to transition from the first node to the second node. A portion of available free storage space is allocated from a first persistent memory of the first node as allocated pages within the first persistent memory. Metadata information for the allocated pages is updated with an identifier of the first aggregate to create updated metadata information reserving the allocated pages for the first aggregate. The updated metadata information is mirrored to the second node, so that the second node also reserves those pages. Control of the first aggregate is transitioned to the second node. As a result, the nodes do not attempt allocating the same free pages to different aggregates during a transition.
-
公开(公告)号：US20210405894A1
公开(公告)日：2021-12-30
申请号：US16911425
申请日：2020-06-25
Applicant: NetApp Inc.
Inventor： Abdul Basit , Ananthan Subramanian , Ram Kesavan , Matthew Fontaine Curtis-Maury
IPC: G06F3/06
Abstract: Techniques are provided for block allocation for persistent memory during aggregate transition. In a high availability pair including first and second nodes, the first node makes a determination that control of a first aggregate is to transition from the first node to the second node. A portion of available free storage space is allocated from a first persistent memory of the first node as allocated pages within the first persistent memory. Metadata information for the allocated pages is updated with an identifier of the first aggregate to create updated metadata information reserving the allocated pages for the first aggregate. The updated metadata information is mirrored to the second node, so that the second node also reserves those pages. Control of the first aggregate is transitioned to the second node. As a result, the nodes do not attempt allocating the same free pages to different aggregates during a transition.
-
公开(公告)号：US10552057B2
公开(公告)日：2020-02-04
申请号：US15167924
申请日：2016-05-27
Applicant: NetApp, Inc.
Inventor： Ram Kesavan , Ananthan Subramanian , Hiroshi Ishii , Abdul Basit , Joseph Brown, Jr. , Rohit Singh
IPC: G06F3/06
Abstract: A method, non-transitory computer readable medium and storage server computing device that determines when a generated storage operation corresponds with one of a set of predefined storage operations. The storage operation is executed and a result of the execution of the storage operation is withheld from a file system, when the determining indicates that the storage operation corresponds with one of the set of predefined storage operations. A determination is made when a consistency point operation has completed. The result of the execution of the storage operation is presented to the file system, when the determining indicates that a consistency point operation has completed. This technology reduces the number of storage operations that are required to be journaled to maintain consistency of a file system, thereby reducing the runtime resources required to facilitate the journaling and replay resource required to replay the storage operations in a journal following a recovery.
-
-
-
-
-
-
-
-
-
Search Results
38
records
(took 0.023 seconds)
