会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 8. 发明公开
    • STORAGE ARRAY OPERATION METHOD AND DEVICE
    • 存储阵列操作方法和装置
    • EP3214537A1
    • 2017-09-06
    • EP16840674.2
    • 2016-06-30
    • Huawei Technologies Co., Ltd.
    • TAN, Chunhua
    • G06F3/06
    • G06F3/0634G06F3/06G06F3/0616G06F3/067
    • Embodiments of the present invention disclose a storage array operation method and apparatus. The method may include: receiving an operation instruction that is delivered by a target service object and that is directed at a cache of a storage array, where service objects supported by the storage array are divided into at least one performance group, and allowable operation traffic is calculated for each performance group in advance; selecting, from the at least one performance group, a target performance group to which the target service object belongs, and determining whether there is still remaining traffic in allowable operation traffic of the target performance group; and responding to the operation instruction if there is still remaining traffic in the allowable operation traffic of the target performance group; or rejecting the operation instruction if there is no remaining traffic in the allowable operation traffic of the target performance group. The embodiments of the present invention can resolve a performance degradation problem of converged storage.
    • 本发明的实施例公开了一种存储阵列操作方法和装置。 该方法可以包括:接收目标服务对象下发的针对存储阵列缓存的操作指令,该存储阵列支持的服务对象划分为至少一个性能组,并且允许的操作流量 预先为每个演出组计算; 从所述至少一个演出组中选择所述目标服务对象所属的目标演出组,并判断所述目标演出组是否还有剩余可用通话量; 如果所述目标演出组的允许操作流量中仍有剩余流量,则响应所述操作指令; 如果目标演出组的允许操作流量中没有剩余流量,则拒绝该操作指令。 本发明实施例可以解决融合存储的性能下降问题。
    • 10. 发明公开
    • ADAPTIVE POWER CONSERVATION IN STORAGE CLUSTERS
    • 自然语言中的自适应列支敦士登式服务
    • EP2457140A4
    • 2017-08-23
    • EP10802734
    • 2010-07-19
    • CARINGO INC
    • DUTTON JAMES EARBILLA LAURAYOAKLEY DAVID
    • G06F3/06G06F1/08G06F1/32G06F15/16
    • G06F1/3296G06F1/08G06F1/32G06F1/3221G06F1/3268G06F1/3287G06F3/0625G06F3/0634G06F3/067Y02D10/154Y02D10/171
    • Each node and volume in a fixed-content storage cluster makes an independent decision whether to reduce power consumption based on lack of requests from client applications and nodes over a configurable time period. Node configuration parameters sleepAfter and wakeAfter respectively determine how long to wait until idling a node or volume, and how long to wait while idle before again performing integrity checks. A bid value is calculated by each node and reflects how much it will cost for that node to write a file, read a file, or keep a copy of the file. A node with the lowest bid wins, and nodes that are idle have a premium added to each bid to help ensure that idle nodes are kept idle. Normally, nodes with more capacity will submit a lower bid to write a file. In an archive mode, writes bids are reversed meaning that nodes with less capacity submit lower bids, meaning that fuller nodes fill up faster and are then idled, while empty or near empty nodes may remain idle for some time before winning a write bid.
    • 固定内容存储群集中的每个节点和卷根据缺少客户端应用程序和节点在可配置时间段内的请求来做出是否降低功耗的独立决策。 节点配置参数sleepAfter和wakeAfter分别确定在空闲节点或卷之前等待多长时间,以及在再次执行完整性检查之前等待空闲多久。 出价值由每个节点计算并反映该节点写入文件,读取文件或保留文件副本的成本。 出价最低的节点获胜,闲置的节点会为每次出价添加溢价,以帮助确保空闲节点闲置。 通常情况下,具有更多容量的节点会提交较低的出价来编写文件。 在归档模式下,写入出价是相反的,这意味着容量较小的节点提交的出价较低,这意味着更全面的节点填满得更快,然后空闲,而空的或接近空的节点在赢得写出价之前可能保持空闲一段时间。