公开(公告)号：US20140040411A1

公开(公告)日：2014-02-06

申请号：US14062440

申请日：2013-10-24

Applicant: NetApp. Inc.

Inventor： Bret S. Weber ,  Mohamad H. El-Batal ,  William P. Delaney

IPC: G06F15/173

CPC classification number: G06F15/17331 ,  G06F3/0607 ,  G06F3/0658 ,  G06F3/067 ,  G06F12/0866 ,  H04L67/1097

Abstract: Systems and associated methods for flexible scalability of storage systems. In one aspect, a storage controller may include an interface to a fabric adapted to permit each storage controller coupled to the fabric to directly access memory mapped components of all other storage controllers coupled to the fabric. The CPU and other master device circuits within a storage controller may directly address memory an I/O devices directly coupled thereto within the same storage controller and may use RDMA features to directly address memory an I/O devices of other storage controllers through the fabric interface.

Abstract translation: 存储系统灵活可扩展性的系统和相关方法。 在一个方面，存储控制器可以包括适合于允许耦合到结构的每个存储控制器直接访问耦合到该结构的所有其他存储控制器的存储器映射组件的结构的接口。 存储控制器内的CPU和其他主设备电路可以直接在同一存储控制器内对与其直接耦合的I / O设备的存储器进行寻址，并且可以使用RDMA特征来通过结构接口直接对其他存储控制器的I / O设备寻址存储器 。

公开(公告)号：US12265716B2

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

申请号：US18191985

申请日：2023-03-29

Applicant: NetApp, Inc.

Inventor： Randolph Sterns ,  Charles Binford ,  William P. Delaney ,  Joseph Blount ,  Reid Kaufmann ,  Joseph Moore

IPC: G06F3/06 ,  G06F11/10

Abstract: The application relates to writing arbitrarily sized data extents using in-line descriptors, such as headers or footers, into physical blocks to describe the data extents in those physical blocks. Some data extents may be smaller than the size of a physical block, and some data extents may be larger than the size of a physical block. A given physical block therefore includes an in-line descriptor for a data extent in that block, indicating that the data extent starts within that block and also an offset from the beginning of the block to where the data extent starts. The in-line descriptor is included within the block so that when the block is read both the data and the descriptor are read, thereby eliminating performance penalty for reading the descriptor information.

公开(公告)号：US20170315924A1

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

申请号：US15143135

申请日：2016-04-29

Applicant: NetApp, Inc.

Inventor： Joseph Blount ,  William P. Delaney ,  Charles Binford ,  Joseph Moore ,  Randolph Sterns

IPC: G06F12/10

CPC classification number: G06F12/10 ,  G06F11/3034 ,  G06F2212/1044 ,  G06F2212/154 ,  G06F2212/262 ,  G06F2212/263 ,  G06F2212/7201

Abstract: A method, a computing device, and a non-transitory machine-readable medium for allocating memory to data structures that map a first address space to a second is provided. In some embodiments, the method includes identifying, by a storage system, a pool of memory resources to allocate among a plurality of address maps. Each of the plurality of address maps includes at least one entry that maps an address in a first address space to an address in a second address space. An activity metric is determined for each of the plurality of address maps, and a portion of the pool of memory is allocated to each of the plurality of address maps based on the respective activity metric. The allocating of the portion of the memory pool to a first map may be performed in response to a merge operation being performed on the first map.

公开(公告)号：US20230229328A1

公开(公告)日：2023-07-20

申请号：US18191985

申请日：2023-03-29

Applicant: NetApp, Inc.

Inventor： Randolph Sterns ,  Charles Binford ,  William P. Delaney ,  Joseph Blount ,  Reid Kaufmann ,  Joseph Moore

IPC: G06F3/06 ,  G06F11/10

CPC classification number: G06F3/064 ,  G06F3/067 ,  G06F3/0607 ,  G06F3/0689 ,  G06F11/1004

Abstract: A method includes: storing a first data extent on a physical medium, wherein the physical medium is divided into a plurality of storage blocks, wherein each of the storage blocks has a size that is different than a size of the first data extent, further wherein the first data extent is stored to a first block of the plurality of storage blocks; generating a descriptor for the first data extent, wherein the descriptor indicates that the first data extent starts within the first block of the plurality of blocks and indicates an offset from the beginning of the first block at which the first data extent starts; and storing the descriptor within the first block.

公开(公告)号：US10802740B2

公开(公告)日：2020-10-13

申请号：US15135161

申请日：2016-04-21

Applicant: NetApp, Inc.

Inventor： Randolph Sterns ,  Charles Binford ,  William P. Delaney ,  Joseph Blount ,  Reid Kaufmann ,  Joseph Moore

IPC: G06F3/06 ,  G06F11/10

Abstract: A method includes: storing a first data extent on a physical medium, wherein the physical medium is divided into a plurality of storage blocks, wherein each of the storage blocks has a size that is different than a size of the first data extent, further wherein the first data extent is stored to a first block of the plurality of storage blocks; generating a descriptor for the first data extent, wherein the descriptor indicates that the first data extent starts within the first block of the plurality of blocks and indicates an offset from the beginning of the first block at which the first data extent starts; and storing the descriptor within the first block.

公开(公告)号：US10366065B2

公开(公告)日：2019-07-30

申请号：US15142828

申请日：2016-04-29

Applicant: NetApp, Inc.

Inventor： William P. Delaney ,  Joseph Blount ,  Charles Binford ,  Joseph Moore ,  Randolph Sterns ,  Jeff Stilger

IPC: G06F17/30 ,  G06F16/22 ,  G06F16/901

Abstract: A method for mapping a first address space to a second address space is provided. In some embodiments, the method includes creating a first array of lookup entries and one or more second arrays of metadata entries for maintaining an ordering among the lookup entries using a tree structure. Each of the metadata entries includes one or more data index values identifying a corresponding one of the lookup entries by its position in the first array and one or more metadata index values identifying a corresponding one of the metadata entries by its position in one of the one or more second arrays. The method further includes receiving a request including a lookup value, traversing the tree structure to locate a lookup entry corresponding to the lookup value, and when the lookup value is located among the lookup entries, using the located lookup entry to process the request.

公开(公告)号：US20190138517A1

公开(公告)日：2019-05-09

申请号：US16241792

申请日：2019-01-07

Applicant: NetApp, Inc.

Inventor： Joseph Blount ,  Joseph Moore ,  William P. Delaney ,  Randolph Sterns

IPC: G06F16/23 ,  G06F16/2457 ,  G06F12/02 ,  G06F16/22

Abstract: A method, a computing device, and a non-transitory machine-readable medium for assessing data segments for garbage collection is provided. In some embodiments, the method includes identifying a plurality of data segments. A first rate at which data within each of the plurality of data segments has been invalidated since a first point in time is determined, and a second rate at which data within each of the plurality of data segments has been invalidated since a second point in time subsequent to the first point in time is determined. The second rate is compared to the first rate for each of the plurality of data segments, and a garbage collection score is assigned to the respective data segment based on the comparison. The garbage collection score may be further based on a utilization of the respective data segment and/or an age of the respective data segment.

公开(公告)号：US20180074723A1

公开(公告)日：2018-03-15

申请号：US15497816

申请日：2017-04-26

Applicant: NetApp, Inc.

Inventor： William P. Delaney ,  Keith Moyer ,  Randolph Sterns ,  Joseph Blount ,  Charles Binford ,  Joseph Moore

IPC: G06F3/06

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

Abstract: A method, a computing device, and a non-transitory machine-readable medium for allocating data compression activities in a storage system are provided. A method includes tracking, by a storage controller, computing resources corresponding to a storage server. The storage controller processes one or more host read requests to access data requested by one or more hosts, the processing of the one or more host read requests including decompressing the data requested by the one or more hosts from the storage server and providing the decompressed data to the one or more hosts. The storage controller determines an amount of available computing resources after processing the one or more host read requests. Based on the amount of available computing resources, the storage controller performs inline compression of a first portion of host write requests and background compression of a second portion of the host write requests.

公开(公告)号：US20170220623A1

公开(公告)日：2017-08-03

申请号：US15010624

申请日：2016-01-29

Applicant: NetApp, Inc.

Inventor： Joseph Blount ,  Joseph Moore ,  William P. Delaney ,  Randolph Sterns

IPC: G06F17/30 ,  G06F12/02

CPC classification number: G06F16/2365 ,  G06F12/0269 ,  G06F16/22 ,  G06F16/24578

Abstract: A method, a computing device, and a non-transitory machine-readable medium for assessing data segments for garbage collection is provided. In some embodiments, the method includes identifying a plurality of data segments. A first rate at which data within each of the plurality of data segments has been invalidated since a first point in time is determined, and a second rate at which data within each of the plurality of data segments has been invalidated since a second point in time subsequent to the first point in time is determined. The second rate is compared to the first rate for each of the plurality of data segments, and a garbage collection score is assigned to the respective data segment based on the comparison. The garbage collection score may be further based on a utilization of the respective data segment and/or an age of the respective data segment.