会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • TECHNIQUE TO AVOID CASCADED HOT SPOTTING
    • 避免加热点火的技术
    • US20140040548A1
    • 2014-02-06
    • US14053933
    • 2013-10-15
    • NetApp, Inc.
    • Robert W. HyerRichard JerniganBryan Schmersal
    • G06F3/06
    • G06F3/0689G06F3/0614G06F3/0619G06F3/0638G06F3/0665G06F3/067
    • 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.
    • 本发明通过提供一种技术来克服现有技术的缺点,该技术使用多个不同的数据放置模式中的一种对条带卷集(SVS)的卷进行条带化数据容器,从而减少由于每个数据而产生的热点的可能性 容器在SVS内使用相同的数据放置模式。 通过计算第一索引值,中间索引值并计算与在SVS内要访问的数据容器相关联的inode的哈希值来说明性地实现该技术。 通过将中间索引值乘以散列值,计算SVS的体积数来计算最终索引值。 此外,可以使用Locate()函数来计算数据访问请求所针对的SVS中的数据容器内容的位置,以确保这些内容的一致性。
    • 6. 发明授权
    • Technique to avoid cascaded hot spotting
    • 避免级联热点技术
    • US08880814B2
    • 2014-11-04
    • US14053933
    • 2013-10-15
    • NetApp, Inc.
    • Robert W. HyerRichard JerniganBryan Schmersal
    • G06F13/00G06F3/06
    • G06F3/0689G06F3/0614G06F3/0619G06F3/0638G06F3/0665G06F3/067
    • 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.
    • 本发明通过提供一种技术来克服现有技术的缺点,该技术使用多个不同的数据放置模式中的一种对条带卷集(SVS)的卷进行条带化数据容器,从而减少由于每个数据而产生的热点的可能性 容器在SVS内使用相同的数据放置模式。 通过计算第一索引值,中间索引值并计算与在SVS内要访问的数据容器相关联的inode的哈希值来说明性地实现该技术。 通过将中间索引值乘以散列值,计算SVS的体积数来计算最终索引值。 此外,可以使用Locate()函数来计算数据访问请求所针对的SVS中的数据容器内容的位置,以确保这些内容的一致性。