中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

6 records (took 0.016 seconds)

    Methods and systems for managing networked storage system resources
    1.
    发明授权
    Methods and systems for managing networked storage system resources 有权

    公开(公告)号：US10200473B2

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

    申请号：US15467316

    申请日：2017-03-23

    Applicant: NETAPP, INC.

    Inventor： John Jason Sprague ,  James Stephen Holden ,  Omri Kessel ,  John Strunk ,  Andrew Joseph Klosterman

    IPC: G06F9/50 ,  H04L12/861 ,  G06F3/12 ,  G06F3/06 ,  G06F17/30 ,  H04L12/26 ,  H04L29/08

    Abstract: Methods and systems for a networked storage environment are provided. One method includes mirroring a plurality of requests from a switch and transmitting the mirrored plurality of requests to a remote acquisition unit; extracting application layer protocol data units from assembled transport layer packets; parsing the application layer protocol data units to obtain file system requests; identifying storage volume identifiers from the parsed file system requests that are associated with a greatest number of operations; identifying network addresses for client systems initiating the greatest number of operations for the storage volumes and network addresses of target storage systems managing the storage volumes; and providing a total number of operations for the plurality of requests in a given time, the identified storage volume identifiers, the network addresses of the client systems and the network addresses of the target storage systems to a management console.

    SYSTEMS AND METHODS FOR HIERARCHICAL REFERENCE COUNTING VIA SIBLING TREES
    3.
    发明申请
    SYSTEMS AND METHODS FOR HIERARCHICAL REFERENCE COUNTING VIA SIBLING TREES 有权
    用于通过记录纸进行分层参考计数的系统和方法

    公开(公告)号：US20140156601A1

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

    申请号：US14085656

    申请日：2013-11-20

    Applicant: NetApp, Inc.

    Inventor： John Strunk ,  Douglas Santry ,  Sriram Venketaraman ,  Vaijayanti Bharadwaj

    IPC: G06F3/06 ,  G06F17/30

    CPC classification number: G06F3/0641 ,  G06F3/0619 ,  G06F3/067 ,  G06F17/30088 ,  G06F17/30094

    Abstract: Systems and methods for hierarchical reference counting via sibling trees are provided. The hierarchical data structure, together with its associated operations, can efficiently maintain reference counts and significantly reduce input/output (IO) operations compared to traditional techniques. The data structure presented here is applicable to any directed acyclic graph (DAG-type) structure where reference counts are used. Various embodiments of the present invention use a data structure to maintain a “sibling pointer” (pointing to the sibling node as a way to avoid reference count updates) and a “sibling count.” When nodes in the tree diverge, the sibling pointer and sibling count are updated as opposed to directly manipulating the reference counts of the children of the diverging nodes. Various other embodiments can use additional entries or fields that allow for improved efficiency and advantages.

    Abstract translation: 提供了通过兄弟树分级引用计数的系统和方法。 与传统技术相比，层次数据结构及其相关操作可以有效地保持参考计数并显着降低输入/输出（IO）操作。 这里呈现的数据结构适用于使用参考计数的任何有向无环图（DAG型）结构。 本发明的各种实施例使用数据结构来保持“同级指针”（指向同级节点作为避免参考计数更新的方式）和“兄弟数量”。当树中的节点发散时，兄弟节点指针和 兄弟姐妹计数被更新，而不是直接操纵分歧节点的孩子的参考计数。 各种其他实施例可以使用允许提高效率和优点的附加条目或字段。

    Methods and systems for managing networked storage system resources
    4.
    发明授权
    Methods and systems for managing networked storage system resources 有权

    公开(公告)号：US10778771B2

    公开(公告)日：2020-09-15

    申请号：US16244416

    申请日：2019-01-10

    Applicant: NETAPP, INC.

    Inventor： John Jason Sprague ,  James Stephen Holden ,  Omri Kessel ,  John Strunk ,  Andrew Joseph Klosterman

    IPC: H04L29/08 ,  G06F16/13 ,  G06F17/17 ,  G06F3/06 ,  G06F9/50 ,  H04L12/861 ,  G06F3/12 ,  G06F16/14 ,  G06F16/182 ,  G06F16/17 ,  H04L12/26

    Abstract: Methods and systems for a networked storage environment are provided. One method includes mirroring a plurality of requests from a switch and transmitting the mirrored plurality of requests to a remote acquisition unit; extracting application layer protocol data units from assembled transport layer packets; parsing the application layer protocol data units to obtain file system requests; identifying storage volume identifiers from the parsed file system requests that are associated with a greatest number of operations; identifying network addresses for client systems initiating the greatest number of operations for the storage volumes and network addresses of target storage systems managing the storage volumes; and providing a total number of operations for the plurality of requests in a given time, the identified storage volume identifiers, the network addresses of the client systems and the network addresses of the target storage systems to a management console.

    Systems and methods for hierarchical reference counting via sibling trees
    6.
    发明授权
    Systems and methods for hierarchical reference counting via sibling trees 有权
    通过兄弟树分级引用计数的系统和方法

    公开(公告)号：US09274716B2

    公开(公告)日：2016-03-01

    申请号：US14085656

    申请日：2013-11-20

    Applicant: NetApp, Inc.

    Inventor： John Strunk ,  Douglas Santry ,  Sriram Venketaraman ,  Vaijayanti Bharadwaj

    IPC: G06F17/30 ,  G06F3/06

    CPC classification number: G06F3/0641 ,  G06F3/0619 ,  G06F3/067 ,  G06F17/30088 ,  G06F17/30094

    Abstract: Systems and methods for hierarchical reference counting via sibling trees are provided. The hierarchical data structure, together with its associated operations, can efficiently maintain reference counts and significantly reduce input/output (IO) operations compared to traditional techniques. The data structure presented here is applicable to any directed acyclic graph (DAG-type) structure where reference counts are used. Various embodiments of the present invention use a data structure to maintain a “sibling pointer” (pointing to the sibling node as a way to avoid reference count updates) and a “sibling count.” When nodes in the tree diverge, the sibling pointer and sibling count are updated as opposed to directly manipulating the reference counts of the children of the diverging nodes. Various other embodiments can use additional entries or fields that allow for improved efficiency and advantages.

    Abstract translation: 提供了通过兄弟树分级引用计数的系统和方法。 与传统技术相比，层次数据结构及其相关操作可以有效地保持参考计数并显着降低输入/输出（IO）操作。 这里呈现的数据结构适用于使用参考计数的任何有向无环图（DAG型）结构。 本发明的各种实施例使用数据结构来保持“同级指针”（指向同级节点作为避免参考计数更新的方式）和“兄弟数量”。当树中的节点发散时，兄弟节点指针和 兄弟姐妹计数被更新，而不是直接操纵分歧节点的孩子的参考计数。 各种其他实施例可以使用允许提高效率和优点的附加条目或字段。

Patent Agency Ranking