Systems and methods for allocating data compression activities in a storage system

    公开(公告)号:US11500592B2

    公开(公告)日:2022-11-15

    申请号:US16707651

    申请日:2019-12-09

    Applicant: NetApp, Inc.

    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.

    Read and write load sharing in a storage array via partitioned ownership of data blocks

    公开(公告)号:US11175831B2

    公开(公告)日:2021-11-16

    申请号:US15496841

    申请日:2017-04-25

    Applicant: NETAPP, INC.

    Abstract: A system shares I/O load between controllers in a high availability system. For writes, a controller determines based on one or more factors which controller will flush batches of data from write-back cache to better distribute the I/O burden. The determination occurs after the local storage controller caches the data, mirrors it, and confirms write complete to the host. Once it is determined which storage controller will flush the cache, the flush occurs and the corresponding metadata at a second layer of indirection is updated by that determined storage controller (whether or not it is identified as the owner of the corresponding volume to the host, while the volume owner updates metadata at a first layer of indirection). For a host read, the controller that owns the volume accesses the metadata from whichever controller(s) flushed the data previously and reads the data, regardless of which controller had performed the flush.

    System and method for simple scale-out storage clusters
    6.
    发明授权
    System and method for simple scale-out storage clusters 有权
    简单的横向扩展存储集群的系统和方法

    公开(公告)号:US09037671B2

    公开(公告)日:2015-05-19

    申请号:US14062440

    申请日:2013-10-24

    Applicant: NetApp, Inc.

    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设备寻址存储器 。

    Memory Efficient Lookup Structure
    9.
    发明申请

    公开(公告)号:US20170316041A1

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

    申请号:US15142828

    申请日:2016-04-29

    Applicant: NetApp, Inc.

    CPC classification number: G06F16/2246 G06F16/2237 G06F16/9017

    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.

Patent Agency Ranking