公开(公告)号：US20230024485A1

公开(公告)日：2023-01-26

申请号：US17958497

申请日：2022-10-03

Applicant: NetApp Inc.

Inventor： Rupa Natarajan ,  Ananthan Subramanian

IPC: G06F16/18 ,  G06F16/16 ,  G06F16/22

Abstract: Techniques are provided for utilizing a log to free pages from persistent memory. A log is maintained to comprise a list of page block numbers of pages within persistent memory of a node to free. A page block number, of a page, within the log is identified for processing. A reference count, corresponding to a number of references to the page block number, is identified. In response to the reference count being greater than 1, the reference count is decremented and the page block number is removed from the log. In response to the reference count being 1, the page is freed from the persistent memory and the page block number is removed from the log.

公开(公告)号：US20220357868A1

公开(公告)日：2022-11-10

申请号：US17868260

申请日：2022-07-19

Applicant: NetApp, Inc.

Inventor： Kevin Daniel Varghese ,  Ananthan Subramanian ,  Parag Sarfare ,  Sandeep Yadav ,  Suhas Urkude ,  Rajesh Khandelwal

IPC: G06F3/06

Abstract: A method and system for co-locating journaling and data storage based on write requests. A write request that includes metadata and data is received from a client. A logical storage unit for storing the metadata and the data is identified. The logical storage unit is divided into a journal partition and a volume partition. The journal partition includes a first log and a second log. Which of the first log and the second log is an active log and which of the first log and the second log is an inactive log are identified. The metadata is recorded in a first location in the active log and the data is recorded in a second location in the active log during a single I/O operation. A reply is sent to the client after the metadata and the data are recorded in the journal partition.

公开(公告)号：US20220335027A1

公开(公告)日：2022-10-20

申请号：US17234894

申请日：2021-04-20

Applicant: NetApp Inc.

Inventor： Sanjay Subramanian Seshadri ,  Arindam Banerjee ,  Manan Dahyabhai Patel ,  Raymond Jordan Go ,  Anil Paul Thoppil ,  Ananthan Subramanian ,  Santhosh Selvaraj ,  Nikul Y. Patel ,  Vikhyath Rao ,  Meera Odugoudar ,  Kevin Daniel Varghese

IPC: G06F16/22 ,  G06F16/21 ,  G06F16/215 ,  G06F16/2457 ,  G06F16/2455 ,  G06F16/248

Abstract: Techniques are provided for key-value store and file system integration to optimize key value store operations. A key-value store is integrated within a file system of a node. A log structured merge tree of the key-value store may be populated with a key corresponding to a content hash of a value data item stored separate from the key. A random distribution search may be performed upon a sorted log of the log structured merge tree to identify the key for accessing the value data item. A starting location for the random distribution search is derived from key information, a log size of the sorted log, and/or a keyspace size of a keyspace associated with the key.

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

公开(公告)号：US20220147418A1

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

申请号：US17582221

申请日：2022-01-24

Applicant: NetApp Inc.

Inventor： Ananthan Subramanian ,  Ganga Bhavani Kondapalli ,  Cheryl Marie Thompson ,  Kevin Daniel Varghese ,  Anil Paul Thoppil ,  Qinghua Zheng

IPC: G06F11/10 ,  G06F12/08 ,  G06F3/06 ,  G06F16/178

Abstract: Techniques are provided for remote object store error handling. A storage system may store data within one or more tiers of storage, such as a local storage tier (e.g., solid state storage and disks maintained by the storage system), a remote object store (e.g., storage provided by a third party storage provider), and/or other storage tiers. Because the remote object store may not provide the same data consistency and guarantees that the storage system provides for clients such as through the local storage tier, additional validation is provided by the storage system for the remote object store. For example, when data is put into an object of the remote object store, a verification get operation is performed to read and validate information within a header of the object. Other verifications and checks are performed such as using a locally stored metafile to detect corrupt or lost metadata and/or objects.

公开(公告)号：US20220138052A1

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

申请号：US17576981

申请日：2022-01-16

Applicant: NetApp Inc.

Inventor： Ananthan Subramanian ,  Ram Kesavan ,  Matthew Fontaine Curtis-Maury ,  Mark Smith

IPC: G06F11/14 ,  G06F3/06 ,  G06F11/20

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.

公开(公告)号：US11231989B2

公开(公告)日：2022-01-25

申请号：US17100905

申请日：2020-11-22

Applicant: NetApp Inc.

Inventor： Ananthan Subramanian ,  Ganga Bhavani Kondapalli ,  Cheryl Marie Thompson ,  Kevin Daniel Varghese ,  Anil Paul Thoppil ,  Qinghua Zheng

IPC: G06F11/10 ,  G06F12/08 ,  G06F3/06 ,  G06F16/178

Abstract: Techniques are provided for remote object store error handling. A storage system may store data within one or more tiers of storage, such as a local storage tier (e.g., solid state storage and disks maintained by the storage system), a remote object store (e.g., storage provided by a third party storage provider), and/or other storage tiers. Because the remote object store may not provide the same data consistency and guarantees that the storage system provides for clients such as through the local storage tier, additional validation is provided by the storage system for the remote object store. For example, when data is put into an object of the remote object store, a verification get operation is performed to read and validate information within a header of the object. Other verifications and checks are performed such as using a locally stored metafile to detect corrupt or lost metadata and/or objects.

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

公开(公告)号：US20210405882A1

公开(公告)日：2021-12-30

申请号：US17028020

申请日：2020-09-22

Applicant: NetApp Inc.

Inventor： Girish Hebbale Venkatasubbaiah ,  Rahul Thapliyal ,  Dnyaneshwar Nagorao Pawar ,  Kartik Rathnakar ,  Venkateswarlu Tella ,  Ananthan Subramanian

IPC: G06F3/06 ,  G06F16/215 ,  G06F16/25 ,  G06F16/28 ,  H03M7/30

Abstract: Techniques are provided for a layout format for compressed data. A first set of data blocks are grouped into a first group based upon a first frequency of access to the first set of data blocks. A second set of data blocks are grouped into a second group based upon a second frequency of access to the second set of data blocks. The first set of data blocks are compressed into a first compression group using a first compression algorithm. The second set of data blocks are compressed into a second compression group using a second compression algorithm.