公开(公告)号：US20200159705A1

公开(公告)日：2020-05-21

申请号：US16751766

申请日：2020-01-24

Applicant: NetApp Inc.

Inventor： Ananthan Subramanian ,  Sridevi Jantli ,  Anil Paul Thoppil ,  Cheryl Marie Thompson ,  Qinghua Zheng

IPC: G06F16/215 ,  G06F16/23 ,  G06F16/22

Abstract: Techniques are provided for orphan object detection, invalid sequence number detection, and asynchronous object cleanup. A storage system may store data within one or more tiers of storage, such as a 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. Orphan objects, within the remote object store, that are no longer used by the storage system may be detected and/or deleted. When an aggregate of volumes is deleted, corresponding objects, within the remote object store, may be identified and/or deleted. Invalid sequence numbers (e.g., lost or corrupt sequence numbers locally maintained in a metafile) assigned to objects within the remote object store may be identified, deleted, and/or fixed.

公开(公告)号：US12282677B2

公开(公告)日：2025-04-22

申请号：US18186685

申请日：2023-03-20

Applicant: NetApp Inc.

Inventor： Anil Paul Thoppil ,  Cheryl Marie Thompson ,  Qinghua Zheng ,  Jeevan Hunsur Eswara ,  Nicholas Gerald Zehender ,  Ronak Girishbhai Ghadiya ,  Sridevi Jantli

IPC: G06F3/06

Abstract: Techniques are provided for object store mirroring. Data within a storage tier of a node may be determined as being data to tier out to a primary object store based upon a property of the data. A first object is generated to comprise the data. A second object is generated to comprise the data. The first object is transmitted to the primary data store for storage in parallel with the second object being transmitted to a mirror object store for storage. Tiering of the data is designated as successful once acknowledgements are received from both the primary object that the first object was stored and the mirror object store that the second object was stored.

公开(公告)号：US20250005003A1

公开(公告)日：2025-01-02

申请号：US18828077

申请日：2024-09-09

Applicant: NetApp, Inc.

Inventor： Ananthan Subramanian ,  Sridevi Jantli ,  Anil Paul Thoppil ,  Cheryl Marie Thompson ,  Qinghua Zheng

IPC: G06F16/215 ,  G06F16/22 ,  G06F16/23

Abstract: Techniques are provided for orphan object detection, invalid sequence number detection, and asynchronous object cleanup. A storage system may store data within one or more tiers of storage, such as a 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. Orphan objects, within the remote object store, that are no longer used by the storage system may be detected and/or deleted. When an aggregate of volumes is deleted, corresponding objects, within the remote object store, may be identified and/or deleted. Invalid sequence numbers (e.g., lost or corrupt sequence numbers locally maintained in a metafile) assigned to objects within the remote object store may be identified, deleted, and/or fixed.

公开(公告)号：US20240289240A1

公开(公告)日：2024-08-29

申请号：US18652325

申请日：2024-05-01

Applicant: NetApp, Inc.

Inventor： Wei Sun ,  Anil Paul Thoppil ,  Anne Marie Vasu

IPC: G06F11/16 ,  G06F3/06 ,  G06F11/10 ,  G06F11/30 ,  G06F16/27

CPC classification number: G06F11/1662 ,  G06F3/0622 ,  G06F3/064 ,  G06F3/0679 ,  G06F11/1088 ,  G06F11/3034 ,  G06F16/27

Abstract: Systems and methods that make use of cluster-level redundancy within a distributed storage system to address various node-level error scenarios are provided. Rather than making use of a generalized one-size-fits-all approach in an effort to reduce complexity, an approach tailored to the node-level error scenario at issue may be performed to avoid doing more than necessary. According to one embodiment, responsive to identification of a failed RAID stripe by a node of a cluster of a distributed storage management system, for each block ID of multiple block IDs associated with the failed RAID stripe, a data block is restored corresponding to the block ID by reading the data block from another node of the cluster having a redundant copy of the data block; and writing the redundant copy of the data block to a storage area of the node that is unaffected by the failed RAID stripe.

公开(公告)号：US20240045848A1

公开(公告)日：2024-02-08

申请号：US18491940

申请日：2023-10-23

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/248 ,  G06F16/2457 ,  G06F16/2455 ,  G06F16/215

CPC classification number: G06F16/2246 ,  G06F16/217 ,  G06F16/248 ,  G06F16/24573 ,  G06F16/24553 ,  G06F16/215

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.

公开(公告)号：US20230350850A1

公开(公告)日：2023-11-02

申请号：US17732046

申请日：2022-04-28

Applicant: NetApp Inc.

Inventor： Anil Paul Thoppil ,  Wei Sun ,  Meera Odugoudar ,  Szu-Wen Kuo ,  Santhosh Selvaraj

IPC: G06F3/06

CPC classification number: G06F3/0605 ,  G06F3/0685 ,  G06F3/0649

Abstract: Techniques are provided for implementing a defragmentation process during a merge operation performed by a re-compaction process upon a log structured merge tree. The log structured merge tree is used to store keys of key-value pairs within a key-value store. As the log structured merge tree fills with keys over time, the re-compaction process is performed to merge keys down to lower levels of the log structured merge tree to re-compact the keys. Re-compaction can result in fragmentation because there is a lack of spatial locality of where the re-compaction operations re-writes the keys within storage. Fragmentation increases read and write amplification when accessing the keys stored in different locations within the storage. Accordingly, the defragmentation process is performed during a last merge operation of the re-compaction process in order to store keys together within the storage, thus reducing read and write amplification when accessing the keys.

公开(公告)号：US20230350610A1

公开(公告)日：2023-11-02

申请号：US17732065

申请日：2022-04-28

Applicant: NetApp Inc.

Inventor： Anil Paul Thoppil ,  We Sun ,  Meera Odugoudar ,  Szu-Wen Kuo ,  Santhosh Selvaraj

IPC: G06F3/06

CPC classification number: G06F3/0652 ,  G06F3/0602 ,  G06F3/068

Abstract: Techniques are provided for implementing a garbage collection process and a prediction read ahead mechanism to prefetch keys into memory to improve the efficiency and speed of the garbage collection process. A log structured merge tree is used to store keys of key-value pairs within a key-value store. If a key is no longer referenced by any worker nodes of a distributed storage architecture, then the key can be freed to store other data. Accordingly, garbage collection is performed to identify and free unused keys. The speed and efficiency of garbage collection is improved by dynamically adjusting the amount and rate at which keys are prefetched from disk and cached into faster memory for processing by the garbage collection process.

公开(公告)号：US11797510B2

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

申请号：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/248 ,  G06F16/2457 ,  G06F16/2455 ,  G06F16/215

CPC classification number: G06F16/2246 ,  G06F16/215 ,  G06F16/217 ,  G06F16/248 ,  G06F16/24553 ,  G06F16/24573

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.

公开(公告)号：US11620071B2

公开(公告)日：2023-04-04

申请号：US17346316

申请日：2021-06-14

Applicant: NetApp Inc.

Inventor： Anil Paul Thoppil ,  Cheryl Marie Thompson ,  Qinghua Zheng ,  Jeevan Hunsur Eswara ,  Nicholas Gerald Zehender ,  Ronak Girishbhai Ghadiya ,  Sridevi Jantli

IPC: G06F3/06

Abstract: Techniques are provided for object store mirroring. Data within a storage tier of a node may be determined as being data to tier out to a primary object store based upon a property of the data. A first object is generated to comprise the data. A second object is generated to comprise the data. The first object is transmitted to the primary data store for storage in parallel with the second object being transmitted to a mirror object store for storage. Tiering of the data is designated as successful once acknowledgements are received from both the primary object that the first object was stored and the mirror object store that the second object was stored.

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