公开(公告)号：US20160306672A1

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

申请号：US14859672

申请日：2015-09-21

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.

公开(公告)号：US20150149637A1

公开(公告)日：2015-05-28

申请号：US14162057

申请日：2014-01-23

Applicant: International Business Machines Corporation

Inventor： Alicia E. Chin ,  Yonggang Hu ,  Jason T S Lam ,  Zhimin Lin ,  Ajith Shanmuganathan

IPC: H04L12/24 ,  H04L12/911

CPC classification number: H04L67/1012 ,  G06F9/00 ,  G06F9/46 ,  H04L41/5019

Abstract: A method, computer program product, and system for optimizing service pools supporting resource sharing and enforcing SLAs, to minimize service restart. A computer processor determines a first resource to be idle, wherein a service instance continues to occupy the first resource that is idle. The processor adds the first resource to a resource pool, wherein the service instance continues to occupy the first resource as a global standby service instance on the first resource. The processor receives a request for a resource, wherein the request for the resource includes a global name associated with a service that corresponds to the global standby service instance, and the processor allocates, from the resource pool, the first resource having the global standby service instance, based on the request for the resource that includes the global name associated with the service corresponding to the global standby service instance.

公开(公告)号：US10079774B2

公开(公告)日：2018-09-18

申请号：US14953453

申请日：2015-11-30

Applicant: International Business Machines Corporation

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

IPC: H04L12/911 ,  H04L12/867 ,  H04L29/08

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

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.

公开(公告)号：US10079773B2

公开(公告)日：2018-09-18

申请号：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 ,  H04L12/867 ,  H04L29/08

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

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.

公开(公告)号：US09658887B2

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

申请号：US14862979

申请日：2015-09-23

Applicant: International Business Machines Corporation

Inventor： Alicia E. Chin ,  Yonggang Hu ,  Zhenhua Hu ,  Jason T S Lam ,  Zhimin Lin

IPC: G06F9/50 ,  G06F9/48

CPC classification number: G06F9/505 ,  G06F9/485 ,  G06F9/4881 ,  G06F9/5005 ,  G06F9/5038 ,  G06F9/524 ,  G06F2209/484

Abstract: A single workload scheduler schedules sessions and tasks having a tree structure to resources, wherein the single workload scheduler has scheduling control of the resources and the tasks of the parent-child workload sessions and tasks. The single workload scheduler receives a request to schedule a child session created by a scheduled parent task that when executed results in a child task; the scheduled parent task is dependent on a result of the child task. The single workload scheduler receives a message from the scheduled parent task yielding a resource based on the resource not being used by the scheduled parent task, schedules tasks to backfill the resource, and returns the resource yielded by the scheduled parent task to the scheduled parent task based on receiving a resume request from the scheduled parent task or determining dependencies of the scheduled parent task have been met.

公开(公告)号：US20170093968A1

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

申请号：US14953453

申请日：2015-11-30

Applicant: International Business Machines Corporation

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

IPC: H04L29/08 ,  H04L12/911 ,  H04L12/867

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.

公开(公告)号：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.