公开(公告)号：US20240103744A1

公开(公告)日：2024-03-28

申请号：US18528556

申请日：2023-12-04

Applicant: NetApp Inc.

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

IPC: G06F3/06

CPC classification number: G06F3/0631 ,  G06F3/0604 ,  G06F3/064 ,  G06F3/065 ,  G06F3/0679

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.

公开(公告)号：US20240086116A1

公开(公告)日：2024-03-14

申请号：US18513894

申请日：2023-11-20

Applicant: NetApp Inc.

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

IPC: G06F3/06 ,  G06F11/14

CPC classification number: G06F3/0659 ,  G06F3/0619 ,  G06F3/0644 ,  G06F3/0653 ,  G06F3/067 ,  G06F3/0683 ,  G06F11/1417 ,  G06F11/1464 ,  G06F11/1469

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.

公开(公告)号：US11340804B2

公开(公告)日：2022-05-24

申请号：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.

公开(公告)号：US20240361912A1

公开(公告)日：2024-10-31

申请号：US18307097

申请日：2023-04-26

Applicant: NetApp Inc.

Inventor： Abdul Basit ,  Daniel McCarthy ,  Christopher Lee Cason ,  Jian Hu

IPC: G06F3/06

CPC classification number: G06F3/0613 ,  G06F3/0659 ,  G06F3/0683

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.

公开(公告)号：US12126502B1

公开(公告)日：2024-10-22

申请号：US18307103

申请日：2023-04-26

Applicant: NetApp Inc.

Inventor： Abdul Basit ,  Daniel McCarthy ,  Christopher Lee Cason ,  Jian Hu

IPC: G06F15/173 ,  G06F9/50 ,  H04L41/5067

CPC classification number: H04L41/5067 ,  G06F9/5072 ,  G06F2209/501 ,  G06F2209/5011 ,  G06F2209/503 ,  G06F2209/505

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.

公开(公告)号：US11836363B2

公开(公告)日：2023-12-05

申请号：US17750793

申请日：2022-05-23

Applicant: NetApp Inc.

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

IPC: G06F3/06

CPC classification number: G06F3/0631 ,  G06F3/0604 ,  G06F3/064 ,  G06F3/065 ,  G06F3/0679

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.

公开(公告)号：US20230251932A1

公开(公告)日：2023-08-10

申请号：US18302212

申请日：2023-04-18

Applicant: NetApp Inc.

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

IPC: G06F11/14 ,  G06F13/16 ,  G06F16/182

CPC classification number: G06F11/1435 ,  G06F13/1668 ,  G06F16/183

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.

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

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