METHODS FOR REPLICATING DATA AND ENABLING INSTANTANEOUS ACCESS TO DATA AND DEVICES THEREOF

    公开(公告)号:US20180011862A1

    公开(公告)日:2018-01-11

    申请号:US15711451

    申请日:2017-09-21

    Applicant: NetApp Inc.

    CPC classification number: G06F16/122 G06F16/1844

    Abstract: A method, non-transitory computer readable medium, and device that replicates data and provides instantaneous access to data includes receiving in a destination volume one or more named data extents and one or more references to the one or more named data extents associated with a file in parallel from a source volume. A determination is made to check whether the one or more references arrive before the one or more named data extents arrive. Each of the received one or more references which are determined to have arrived prior to the one or more data extents is allocated as absent by the storage management computing device. An instantaneous access to the file is provided during the allocation.

    Methods for ensuring correctness of file system analytics and devices thereof

    公开(公告)号:US11561935B2

    公开(公告)日:2023-01-24

    申请号:US17383645

    申请日:2021-07-23

    Applicant: NetApp, Inc.

    Abstract: Methods, non-transitory machine readable media, and computing devices that ensure correctness of file system analytics are disclosed. With this technology, a first generation number for a volume is incremented in response to a modification of a rule set that defines properties of objects of a file system associated with the volume. A determination is made when a second generation number in a first inode for a first one of the objects matches the first generation number. The first inode is identified based on a traversal of a directory tree associated with the file system. The modified rule set is applied to the properties for the first one of the objects to obtain values, when the second generation number fails to match the first generation number. Analytics data is output after the traversal has completed. The analytics data is generated in response to a query and is based on the values.

    TECHNIQUE TO AVOID CASCADED HOT SPOTTING
    6.
    发明申请
    TECHNIQUE TO AVOID CASCADED HOT SPOTTING 有权
    避免加热点火的技术

    公开(公告)号:US20140040548A1

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

    申请号:US14053933

    申请日:2013-10-15

    Applicant: NetApp, Inc.

    Abstract: The present invention overcomes the disadvantages of the prior art by providing a technique that stripes data containers across volumes of a striped volume set (SVS) using one of a plurality of different data placement patterns to thereby reduce the possibility of hotspots arising due to each data container using the same data placement pattern within the SVS. The technique is illustratively implemented by calculating a first index value, an intermediate index value and calculating a hash value of an inode associated with a data container to be accessed within the SVS. A final index value is calculated by multiplying the intermediate index value by the hash value, modulo the number of volumes of the SVS. Further, a Locate( ) function may be used to compute the location of data container content in the SVS to which a data access request is directed to ensure consistency of such content.

    Abstract translation: 本发明通过提供一种技术来克服现有技术的缺点,该技术使用多个不同的数据放置模式中的一种对条带卷集(SVS)的卷进行条带化数据容器,从而减少由于每个数据而产生的热点的可能性 容器在SVS内使用相同的数据放置模式。 通过计算第一索引值,中间索引值并计算与在SVS内要访问的数据容器相关联的inode的哈希值来说明性地实现该技术。 通过将中间索引值乘以散列值,计算SVS的体积数来计算最终索引值。 此外,可以使用Locate()函数来计算数据访问请求所针对的SVS中的数据容器内容的位置,以确保这些内容的一致性。

    METHODS FOR HIERARCHICAL PROPAGATION IN TREE STRUCTURES AND DEVICES THEREOF

    公开(公告)号:US20220318271A1

    公开(公告)日:2022-10-06

    申请号:US17217333

    申请日:2021-03-30

    Applicant: NetApp, Inc.

    Abstract: Methods, non-transitory machine readable media, and computing devices that provide more efficient hierarchical propagation in tree structures are disclosed. With this technology, a first delta record for a first interior node is created optionally in an atomic transaction along with updating a first tally record for a leaf node based on a first value. The transaction is in response to an action associated with the leaf node and the first interior node is a parent of the leaf node in a hierarchical tree. A timer associated with the first delta record is then set. A second value is updated in a second tally record for the first interior node based on the first value, when the timer has expired. Accordingly, this technology advantageously maintains recursive properties or values throughout a hierarchical tree continually, with reduced cost, even in a distributed network and in hierarchical trees with large numbers of nodes.

    METHODS FOR REPLICATING DATA AND ENABLING INSTANTANEOUS ACCESS TO DATA AND DEVICES THEREOF
    8.
    发明申请
    METHODS FOR REPLICATING DATA AND ENABLING INSTANTANEOUS ACCESS TO DATA AND DEVICES THEREOF 有权
    数据的替换方法和实现数据的即时访问及其设备

    公开(公告)号:US20160117374A1

    公开(公告)日:2016-04-28

    申请号:US14522820

    申请日:2014-10-24

    Applicant: NetApp, Inc.

    CPC classification number: G06F17/30082 G06F17/30215

    Abstract: A method, non-transitory computer readable medium, and device that replicates data and provides instantaneous access to data includes receiving in a destination volume one or more named data extents and one or more references to the one or more named data extents associated with a file in parallel from a source volume. A determination is made to check whether the one or more references arrive before the one or more named data extents arrive. Each of the received one or more references which are determined to have arrived prior to the one or more data extents is allocated as absent by the storage management computing device. An instantaneous access to the file is provided during the allocation.

    Abstract translation: 一种方法,非暂时性计算机可读介质和复制数据并提供对数据的即时访问的设备包括在目的地卷中接收一个或多个命名的数据盘区以及对与文件相关联的一个或多个命名的数据盘区的一个或多个引用 从源卷并行。 确定在一个或多个命名的数据盘区到达之前检查一个或多个引用是否到达。 被确定为在一个或多个数据盘区之前已经到达的接收到的一个或多个引用中的每一个被分配为存储管理计算设备不存在。 在分配期间提供对文件的即时访问。

    Technique to avoid cascaded hot spotting
    9.
    发明授权
    Technique to avoid cascaded hot spotting 有权
    避免级联热点技术

    公开(公告)号:US08880814B2

    公开(公告)日:2014-11-04

    申请号:US14053933

    申请日:2013-10-15

    Applicant: NetApp, Inc.

    Abstract: The present invention overcomes the disadvantages of the prior art by providing a technique that stripes data containers across volumes of a striped volume set (SVS) using one of a plurality of different data placement patterns to thereby reduce the possibility of hotspots arising due to each data container using the same data placement pattern within the SVS. The technique is illustratively implemented by calculating a first index value, an intermediate index value and calculating a hash value of an inode associated with a data container to be accessed within the SVS. A final index value is calculated by multiplying the intermediate index value by the hash value, modulo the number of volumes of the SVS. Further, a Locate( ) function may be used to compute the location of data container content in the SVS to which a data access request is directed to ensure consistency of such content.

    Abstract translation: 本发明通过提供一种技术来克服现有技术的缺点,该技术使用多个不同的数据放置模式中的一种对条带卷集(SVS)的卷进行条带化数据容器,从而减少由于每个数据而产生的热点的可能性 容器在SVS内使用相同的数据放置模式。 通过计算第一索引值,中间索引值并计算与在SVS内要访问的数据容器相关联的inode的哈希值来说明性地实现该技术。 通过将中间索引值乘以散列值,计算SVS的体积数来计算最终索引值。 此外,可以使用Locate()函数来计算数据访问请求所针对的SVS中的数据容器内容的位置,以确保这些内容的一致性。

    Methods for hierarchical propagation in tree structures and devices thereof

    公开(公告)号:US11941030B2

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

    申请号:US18086332

    申请日:2022-12-21

    Applicant: NetApp, Inc.

    CPC classification number: G06F16/282 G06F16/2246 G06F16/2322 G06F16/2358

    Abstract: Methods, non-transitory machine readable media, and computing devices that provide more efficient hierarchical propagation in tree structures are disclosed. With this technology, a first delta record for a first interior node is created optionally in an atomic transaction along with updating a first tally record for a leaf node based on a first value. The transaction is in response to an action associated with the leaf node and the first interior node is a parent of the leaf node in a hierarchical tree. A timer associated with the first delta record is then set. A second value is updated in a second tally record for the first interior node based on the first value, when the timer has expired. Accordingly, this technology advantageously maintains recursive properties or values throughout a hierarchical tree continually, with reduced cost, even in a distributed network and in hierarchical trees with large numbers of nodes.

Patent Agency Ranking