中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

33 records (took 0.021 seconds)

    Efficient recovery of erasure coded data
    22.
    发明授权
    Efficient recovery of erasure coded data 有权

    公开(公告)号：US10795789B2

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

    申请号：US16460404

    申请日：2019-07-02

    Applicant: NetApp, Inc.

    Inventor： Emalayan Vairavanathan ,  Dheeraj Raghavender Sangamkar ,  Song Guen Yoon ,  Yi Zhang

    IPC: G06F11/20 ,  G06F11/10 ,  H04L29/08 ,  G06F3/06 ,  G06F11/14 ,  G06F3/12 ,  H04L29/14 ,  H03M13/15 ,  G06F9/50

    Abstract: To efficiently recover from a multiple storage node failure, a storage node concurrently restores data fragments to the multiple failed storage nodes, as opposed to restoring each node individually. In the VCS based storage technique, storage nodes are restored as part of an ECG repair process. For each ECG being repaired, a storage node performing the restoration process reads data fragments from active nodes in the ECG and generates new data fragments to replace any lost data fragments. The node then stores one of the new data fragments across each of the failed storage nodes. By concurrently restoring data fragments to each failed storage node, the data fragments needed to repair each ECG are only read once, thereby preserving disk operations and network bandwidth.

    Erasure coding repair availability
    27.
    发明授权
    Erasure coding repair availability 有权

    公开(公告)号：US10558538B2

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

    申请号：US15820518

    申请日：2017-11-22

    Applicant: NetApp, Inc.

    Inventor： Song Guen Yoon ,  Dheeraj Raghavender Sangamkar ,  Emalayan Vairavanathan

    IPC: G06F11/00 ,  G06F11/20 ,  G06F11/10 ,  H03M13/15

    Abstract: Distributed storage systems frequently use a centralized metadata repository that stores metadata in an eventually consistent distributed database. However, a metadata repository cannot be relied upon for determining which erasure coded fragments are lost because of a storage node(s) failures. Instead, when recovering a failed storage node, a list of missing fragments is generated based on fragments stored in storage devices of available storage nodes. A storage node performing the recovery sends a request to one or more of the available storage nodes for a fragment list. The fragment list is generated, not based on a metadata database, but on scanning storage devices for fragments related to the failed storage node. The storage node performing the recovery merges retrieved lists to create a master list indicating fragments that should be regenerated for recovery of the failed storage node(s).

    SPACE RESERVATION FOR DISTRIBUTED STORAGE SYSTEMS
    28.
    发明申请
    SPACE RESERVATION FOR DISTRIBUTED STORAGE SYSTEMS 审中-公开

    公开(公告)号：US20190332304A1

    公开(公告)日：2019-10-31

    申请号：US16505339

    申请日：2019-07-08

    Applicant: NETAPP, INC.

    Inventor： Tymoteusz Altman ,  Yi Zhang ,  Dheeraj Raghavender Sangamkar ,  Emalayan Vairavanathan

    IPC: G06F3/06

    Abstract: Techniques are described for reserving space on a destination node or volume for increasing the likelihood of a successful data transfer in a distributed storage environment. A reservation may be retried at one or more destinations if the reservation fails at a first destination. In some embodiments, the data-transfer process can be paused or terminated prior to data being transferred to one or more destinations if a reservation fails. Reserving space on a destination node or volume can increase the likelihood of a successful data transfer, which can increase the likelihood of efficient resources usage in a storage system.

    MANAGER ELECTION FOR ERASURE CODING GROUPS
    29.
    发明申请
    MANAGER ELECTION FOR ERASURE CODING GROUPS 审中-公开

    公开(公告)号：US20190251009A1

    公开(公告)日：2019-08-15

    申请号：US16391842

    申请日：2019-04-23

    Applicant: NetApp, Inc.

    Inventor： Dheeraj Raghavender Sangamkar ,  Song Guen Yoon ,  Emalayan Vairavanathan ,  Yi Zhang

    IPC: G06F11/20 ,  G06F3/06 ,  G06F11/10 ,  H04L29/08 ,  H03M13/15

    Abstract: To ensure that there is an elected manager among storage nodes of an erasure coding group (“ECG”), an ECG manager (“ECGM”) election process is periodically performed among available storage nodes that are configured with the software to perform the services of an ECGM. When a storage node is activated, an ECGM process of the storage node begins executing and is assigned a process identifier (“PID”). A storage node can utilize a service query framework to identify other available storage nodes and retrieve their ECGM PIDs. The storage node then selects a PID according to a criterion and elects the storage node corresponding to the selected PID to be the acting ECGM. This process is performed periodically, so even if the acting ECGM storage node fails, a new ECGM is eventually selected from the available storage nodes.

Patent Agency Ranking