-
公开(公告)号:US20230376455A1
公开(公告)日:2023-11-23
申请号:US18361966
申请日:2023-07-31
Applicant: NetApp Inc.
Inventor: Ananthan Subramanian , Matthew Fontaine Curtis-Maury , Ram Kesavan , Rupa Natarajan , Vinay Devadas
IPC: G06F16/11
CPC classification number: G06F16/128
Abstract: Techniques are provided for coordinating snapshot operations across multiple file systems. A notification may be received that a snapshot of data stored across a persistent memory file system and a storage file system is to be generated. Forwarding, of modify operations from a persistent memory tier to a file system tier for execution through the storage file system, may be enabled. Framing may be initiated to notify the storage file system of blocks within the persistent memory file system that comprise more up-to-date data than corresponding blocks within the storage file system. In response to the framing completing, a consistency point operation is performed to create the snapshot and to create a snapshot image as part of the snapshot.
-
公开(公告)号: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.
-
公开(公告)号: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.
-
公开(公告)号:US20220138052A1
公开(公告)日:2022-05-05
申请号:US17576981
申请日:2022-01-16
Applicant: NetApp Inc.
Inventor: Ananthan Subramanian , Ram Kesavan , Matthew Fontaine Curtis-Maury , Mark Smith
Abstract: Techniques are provided for implementing a persistent memory storage tier to manage persistent memory of a node. The persistent memory is managed by the persistent memory storage tier at a higher level within a storage operating system storage stack than a level at which a storage file system of the node is managed. The persistent memory storage tier intercepts an operation targeting the storage file system. The persistent memory storage tier retargets the operation from targeting the storage file system to targeting the persistent memory. The operation is transmitted to the persistent memory.
-
公开(公告)号: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.
-
-
-
-