公开(公告)号：US11941297B2

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

申请号：US17717469

申请日：2022-04-11

Applicant: NetApp Inc.

Inventor： Manan Dahyabhai Patel ,  Wei Sun

IPC: G06F12/00 ,  G06F3/06 ,  G06F12/02

CPC classification number: G06F3/0659 ,  G06F3/0604 ,  G06F3/064 ,  G06F3/0679 ,  G06F12/0253

Abstract: Techniques are provided for implementing garbage collection and bin synchronization for a distributed storage architecture of worker nodes managing distributed storage composed of bins of blocks. As the distributed storage architecture scales out to accommodate more storage and worker nodes, garbage collection used to free unused blocks becomes unmanageable and slow. Accordingly garbage collection is improved by utilizing heuristics to dynamically speed up or down garbage collection and set sizes for subsets of a bin to process instead of the entire bin. This ensures that garbage collection does not use stale information about what blocks are in-use, and ensures garbage collection does not unduly impact client I/O processing or conversely falls behind on garbage collection. Garbage collection can be incorporated into a bin sync process to improve the efficiency of the bin sync process so that unused blocks are not needlessly copied by the bin sync process.

公开(公告)号：US20240220106A1

公开(公告)日：2024-07-04

申请号：US18607651

申请日：2024-03-18

Applicant: NetApp, Inc.

Inventor： Manan Dahyabhai Patel ,  Wei Sun

IPC: G06F3/06

CPC classification number: G06F3/0608 ,  G06F3/0652 ,  G06F3/067

Abstract: Techniques are provided for implementing garbage collection and bin synchronization for a distributed storage architecture of worker nodes managing distributed storage composed of bins of blocks. As the distributed storage architecture scales out to accommodate more storage and worker nodes, garbage collection used to free unused blocks becomes unmanageable and slow. Accordingly garbage collection is improved by utilizing heuristics to dynamically speed up or down garbage collection and set sizes for subsets of a bin to process instead of the entire bin. This ensures that garbage collection does not use stale information about what blocks are in-use, and ensures garbage collection does not unduly impact client I/O processing or conversely falls behind on garbage collection. Garbage collection can be incorporated into a bin sync process to improve the efficiency of the bin sync process so that unused blocks are not needlessly copied by the bin sync process.

公开(公告)号：US11934656B2

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

申请号：US17717454

申请日：2022-04-11

Applicant: NetApp Inc.

Inventor： Manan Dahyabhai Patel ,  Wei Sun

IPC: G06F3/06

CPC classification number: G06F3/0608 ,  G06F3/0652 ,  G06F3/067

Abstract: Techniques are provided for implementing garbage collection and bin synchronization for a distributed storage architecture of worker nodes managing distributed storage composed of bins of blocks. As the distributed storage architecture scales out to accommodate more storage and worker nodes, garbage collection used to free unused blocks becomes unmanageable and slow. Accordingly garbage collection is improved by utilizing heuristics to dynamically speed up or down garbage collection and set sizes for subsets of a bin to process instead of the entire bin. This ensures that garbage collection does not use stale information about what blocks are in-use, and ensures garbage collection does not unduly impact client I/O processing or conversely falls behind on garbage collection. Garbage collection can be incorporated into a bin sync process to improve the efficiency of the bin sync process so that unused blocks are not needlessly copied by the bin sync process.

公开(公告)号：US20240220165A1

公开(公告)日：2024-07-04

申请号：US18607665

申请日：2024-03-18

Applicant: NetApp Inc.

Inventor： Manan Dahyabhai Patel ,  Wei Sun

IPC: G06F3/06 ,  G06F12/02

CPC classification number: G06F3/0659 ,  G06F3/0604 ,  G06F3/064 ,  G06F3/0679 ,  G06F12/0253

Abstract: Techniques are provided for implementing garbage collection and bin synchronization for a distributed storage architecture of worker nodes managing distributed storage composed of bins of blocks. As the distributed storage architecture scales out to accommodate more storage and worker nodes, garbage collection used to free unused blocks becomes unmanageable and slow. Accordingly garbage collection is improved by utilizing heuristics to dynamically speed up or down garbage collection and set sizes for subsets of a bin to process instead of the entire bin. This ensures that garbage collection does not use stale information about what blocks are in-use, and ensures garbage collection does not unduly impact client I/O processing or conversely falls behind on garbage collection. Garbage collection can be incorporated into a bin sync process to improve the efficiency of the bin sync process so that unused blocks are not needlessly copied by the bin sync process.

公开(公告)号：US20230325116A1

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

申请号：US17717469

申请日：2022-04-11

Applicant: NetApp Inc.

Inventor： Manan Dahyabhai Patel ,  Wei Sun

IPC: G06F3/06 ,  G06F12/02

CPC classification number: G06F3/0659 ,  G06F3/064 ,  G06F3/0604 ,  G06F3/0679 ,  G06F12/0253

Abstract: Techniques are provided for implementing garbage collection and bin synchronization for a distributed storage architecture of worker nodes managing distributed storage composed of bins of blocks. As the distributed storage architecture scales out to accommodate more storage and worker nodes, garbage collection used to free unused blocks becomes unmanageable and slow. Accordingly garbage collection is improved by utilizing heuristics to dynamically speed up or down garbage collection and set sizes for subsets of a bin to process instead of the entire bin. This ensures that garbage collection does not use stale information about what blocks are in-use, and ensures garbage collection does not unduly impact client I/O processing or conversely falls behind on garbage collection. Garbage collection can be incorporated into a bin sync process to improve the efficiency of the bin sync process so that unused blocks are not needlessly copied by the bin sync process.

公开(公告)号：US20230325081A1

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

申请号：US17717454

申请日：2022-04-11

Applicant: NetApp Inc.

Inventor： Manan Dahyabhai Patel ,  Wei Sun

IPC: G06F3/06

CPC classification number: G06F3/0608 ,  G06F3/067 ,  G06F3/0652

Abstract: Techniques are provided for implementing garbage collection and bin synchronization for a distributed storage architecture of worker nodes managing distributed storage composed of bins of blocks. As the distributed storage architecture scales out to accommodate more storage and worker nodes, garbage collection used to free unused blocks becomes unmanageable and slow. Accordingly garbage collection is improved by utilizing heuristics to dynamically speed up or down garbage collection and set sizes for subsets of a bin to process instead of the entire bin. This ensures that garbage collection does not use stale information about what blocks are in-use, and ensures garbage collection does not unduly impact client I/O processing or conversely falls behind on garbage collection. Garbage collection can be incorporated into a bin sync process to improve the efficiency of the bin sync process so that unused blocks are not needlessly copied by the bin sync process.

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

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

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