利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

13 条记录 (耗时 0.018 秒)

    Resource allocation for a plurality of resources for a dual activity system
    2.
    发明授权
    Resource allocation for a plurality of resources for a dual activity system 有权
    用于双重活动系统的多个资源的资源分配

    公开(公告)号：US09396027B2

    公开(公告)日：2016-07-19

    申请号：US14190687

    申请日：2014-02-26

    申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION

    发明人： Yariv Bachar ,  Ron Edelstein ,  Oded Sonin

    IPC分类号： G06F9/46 ,  G06F9/50

    CPC分类号： G06F9/50 ,  G06F9/5083 ,  G06F2209/504 ,  Y02D10/22

    摘要： For resource allocation of resources for a dual activity system, each of the dual activities may be started at a static quota and is allocated its respective static quota of resources, and determining which of the dual activities is a demanding dual activity. The resource boundary may be increased for a resource request for at least one of the dual activities until a resource request for an alternative one of the at least one of the dual activities is rejected. A reduced actual resource boundary for the demanding dual activity based on a multiplicative decrease of the dual activity's actual resource boundary is calculated, and the resource boundary for the at least one of the dual activities may be reduced, and a wait after decrease mode may be commenced until a current resource usage is one of less than and equal to the reduced resource boundary.

    摘要翻译： 为了资源分配双重活动系统的资源，每个双重活动可以以静态配额启动，并分配其相应的静态资源配额，并确定哪些双重活动是要求较高的双重活动。 对于针对至少一个双重活动的资源请求，资源边界可以被增加，直到双重活动中的至少一个的另一个活动的资源请求被拒绝为止。 计算出基于双重活动的实际资源边界的乘法减少的要求双重活动的实际资源边界减少，并且可以减少双活动中的至少一个的资源边界，并且减少模式之后的等待可以是 开始直到当前资源使用量小于和等于减少的资源边界之一。

    Resource allocation for a plurality of resources for a dual activity system
    4.
    发明授权
    Resource allocation for a plurality of resources for a dual activity system 失效
    用于双重活动系统的多个资源的资源分配

    公开(公告)号：US08683481B2

    公开(公告)日：2014-03-25

    申请号：US13778571

    申请日：2013-02-27

    申请人： International Business Machines Corporation

    发明人： Yariv Bachar ,  Ron Edelstein ,  Oded Sonin

    IPC分类号： G06F9/50

    CPC分类号： G06F9/50 ,  G06F9/5083 ,  G06F2209/504 ,  Y02D10/22

    摘要： Exemplary method, system, and computer program product embodiments for resource allocation of a plurality of resources for a dual activity system by a processor device, are provided. In one embodiment, by way of example only, each of the activities may be started at a static quota. The resource boundary may be increased for a resource request for at least one of the dual activities until a resource request for an alternative one of the at least one of the dual activities is rejected. In response to the rejection of the resource request for the alternative one of the at least one of the dual activities, a resource boundary for the at least one of the dual activities may be reduced, and a wait after decrease mode may be commenced until a current resource usage is one of less than and equal to the reduced resource boundary.

    摘要翻译： 提供了用于由处理器设备为双重活动系统的多个资源的资源分配的示例性方法，系统和计算机程序产品实施例。 在一个实施例中，仅作为示例，每个活动可以以静态配额开始。 对于针对至少一个双重活动的资源请求，资源边界可以被增加，直到双重活动中的至少一个的另一个活动的资源请求被拒绝为止。 为了响应对双重活动中的至少一个的替代方案的资源请求的拒绝，可以减少双重活动中的至少一个的资源边界，并且可以开始减小模式之后的等待直到 当前的资源使用量小于和等于资源边界的减少。

    Method and system for processing data
    7.
    发明授权
    Method and system for processing data 有权

    公开(公告)号：US09933978B2

    公开(公告)日：2018-04-03

    申请号：US13647561

    申请日：2012-10-09

    申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION

    发明人： Shay H. Akirav ,  Ron Edelstein ,  Michael Hirsch ,  Ariel J. Ish-Shalom ,  Liran Loya ,  Itai Tzur

    IPC分类号： G06F17/30 ,  G06F3/06

    CPC分类号： G06F3/0661 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/0656 ,  G06F3/0682 ,  G06F17/30159

    摘要： Methods, computer systems, and computer program products for processing data a computing environment are provided. The computer environment for data deduplication storage receives a plurality of write operations for deduplication storage of the data. The data is buffered in a plurality of buffers with overflow temporarily stored to a memory hierarchy when the data received for deduplication storage is sequential or non sequential. The data is accumulated and updated in the plurality of buffers per a data structure, the data structure serving as a fragment map between the plurality of buffers and a plurality of user file locations. The data is restructured in the plurality of buffers to form a complete sequence of a required sequence size. The data is provided as at least one stream to a stream-based deduplication algorithm for processing and storage.

    Dynamically balancing resource requirements for clients with unpredictable loads
    10.
    发明授权
    Dynamically balancing resource requirements for clients with unpredictable loads 有权
    动态平衡不可预测负载的客户端的资源需求

    公开(公告)号：US09537787B2

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

    申请号：US13958849

    申请日：2013-08-05

    申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION

    发明人： Yariv Bachar ,  Ron Edelstein ,  Alon Horowitz ,  Oded Sonin

    IPC分类号： G06F15/173 ,  H04L12/911 ,  G06F9/50 ,  H04L29/08

    CPC分类号： H04L47/70 ,  G06F9/50 ,  G06F9/505 ,  G06F2209/504 ,  H04L67/10 ,  H04L67/1002 ,  Y02D10/22

    摘要： In one embodiment, by way of example only, a resource threshold limits the resource usage of each of the multiplicity of clients. The resource threshold of each of the multiplicity of clients increases over time and decreases when the resources deplete and a resource request of a client is rejected. A subset of clients is created from the multiplicity of clients having a resource usage greater than the resource usage of the rejected client. A dynamic average of a normalized number of resources is calculated from the subset of clients. The resource threshold of each client from the subset of clients is decreased based on the dynamic average of the subset of clients, and further acquisition of resources is restricted from each client from the subset of clients in order to bring the resource usage of each of the subset of clients under the resource threshold.

    摘要翻译： 在一个实施例中，仅作为示例，资源阈值限制了多个客户端中的每一个的资源使用。 多个客户端中的每一个的资源阈值随着时间而增加，并且当资源耗尽并且客户端的资源请求被拒绝时减少。 从具有大于被拒绝的客户端的资源使用的资源使用的多个客户端创建客户端的子集。 从客户端的子集计算归一化资源数量的动态平均值。 来自客户端子集的每个客户端的资源门槛基于客户端子集的动态平均值而减少，并且来自每个客户端的资源的进一步获取从客户端子集中被限制，以便将每个客户端的资源使用量 资源阈值下的客户端子集。