中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

15 records (took 0.019 seconds)

    MULTI-DIMENSION SCHEDULING AMONG MULTIPLE CONSUMERS
    2.
    发明申请
    MULTI-DIMENSION SCHEDULING AMONG MULTIPLE CONSUMERS 有权
    多个消费者的多尺度调度

    公开(公告)号：US20160306662A1

    公开(公告)日：2016-10-20

    申请号：US14690866

    申请日：2015-04-20

    Applicant: International Business Machines Corporation

    Inventor： Alicia E. Chin ,  Michael Feiman ,  Zhenhua Hu ,  Jason T. S. Lam ,  Zhimin Lin ,  Lei Su ,  Hao Zhou

    IPC: G06F9/50

    CPC classification number: G06F9/505 ,  G06F9/5005 ,  G06F9/5027 ,  G06F9/5038 ,  G06F2209/5011

    Abstract: Embodiments of the present invention provide systems and methods for allocating multiple resources. In one embodiment, a configured resource plan is used to construct a hierarchical tree. The system then identifies a set of unowned resources from the configured resource plan and sends the set of unowned resource to a share pool. The share pool is either a global or local pool and can be accessed by one or more consumers. In response to changes in workload demands, a set of unused resources are lent to a global or local pool.

    Abstract translation: 本发明的实施例提供了用于分配多个资源的系统和方法。 在一个实施例中，使用配置的资源计划来构建分层树。 然后，系统从配置的资源计划中识别一组未知资源，并将该组未知资源发送到共享池。 共享池是全局或本地池，可由一个或多个消费者访问。 为了响应工作负载需求的变化，一组未使用的资源被借给全局或本地池。

    DISTRIBUTED APPLICATIONS MANAGEMENT WITH DEPENDENT RESILIENT DISTRIBUTED SERVICES
    4.
    发明申请
    DISTRIBUTED APPLICATIONS MANAGEMENT WITH DEPENDENT RESILIENT DISTRIBUTED SERVICES 审中-公开

    公开(公告)号：US20170149864A1

    公开(公告)日：2017-05-25

    申请号：US14949983

    申请日：2015-11-24

    Applicant: International Business Machines Corporation

    Inventor： Michael Feiman ,  Lei Guo ,  Jason T. S. Lam ,  Zhimin Lin ,  Ting Xue

    IPC: H04L29/08

    CPC classification number: H04L67/10 ,  G06F11/0703 ,  H04L69/40

    Abstract: A system for managing a distributed service may include one or more compute nodes, with each compute node having one or more computer processors and a memory. The system may additionally include: a set of software services, the set of software services including the distributed service; a configuration manager to store configuration information about the distributed service, including a criteria for transitioning the distributed service from a first execution state to an initialization state, the criteria associating the execution first state with a second execution state of a first service of the set of software services; a set of measuring agents to obtain execution information from the set of software services; an execution system configured to: determine, based on the execution information, whether the criteria is satisfied; and transition, in response to determining that the criteria is satisfied, the distributed service from the first execution state to the initialization state.

    HIERARCHICAL FAIRSHARE OF MULTI-DIMENSIONAL RESOURCES
    8.
    发明申请
    HIERARCHICAL FAIRSHARE OF MULTI-DIMENSIONAL RESOURCES 审中-公开

    公开(公告)号：US20170093741A1

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

    申请号：US14869089

    申请日：2015-09-29

    Applicant: International Business Machines Corporation

    Inventor： Alicia E. Chin ,  Michael Feiman ,  Zhenhua Hu ,  Zhimin Lin ,  Jian Tan ,  Li Zhang

    IPC: H04L12/911

    CPC classification number: H04L67/1074 ,  G06F9/38 ,  H04L47/629 ,  H04L47/70 ,  H04L47/782

    Abstract: A method to determine a hierarchical fair share of resources among one or more scheduling peers. The method determines a greatest fairness difference between the usage percentage difference of a most-served competing peer and that of a least-served competing peer. The method determines a greatest accumulated fairness difference between the accumulated usage percentage difference of the most-served competing peer and that of the least-served competing peer. The method adjusts a resource allocation such that resources from the most-served competing peer are allocated to the least-served competing peer if an adjustment condition is met, wherein the adjustment condition is based on one or both of i) the greatest fairness difference, and ii) whether the greatest accumulated fairness difference exceeds at least one threshold.

    Deadlock resolution between distributed processes
    10.
    发明授权
    Deadlock resolution between distributed processes 有权

    公开(公告)号：US10970132B2

    公开(公告)日：2021-04-06

    申请号：US16358376

    申请日：2019-03-19

    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION

    Inventor： Lior Aronovich ,  Michael Feiman ,  Ting Xue

    IPC: G06F9/46 ,  G06F9/52 ,  G06F9/50 ,  G06F9/48

    Abstract: A system for resolving a resource deadlock between processes. A shared data structure is maintained that includes process records of the processes. Process states and process priorities are defined for each of the processes. A respective state of the process is determined for each process based on the process states and process priorities of the process records maintained in the shared data structure. The respective state is used to allocate and deallocate resources to the process to mitigate and resolve the resource deadlock between the processes.

Patent Agency Ranking