Abstract: Embodiments for optimizing resource usage in a distributed computing environment. Resource usage of each task in a set of running tasks associated with a job is monitored to collect resource usage information corresponding to each respective task. A resource unit size of at least one resource allocated to respective tasks in the set of running tasks is adjusted based on the resource usage information to improve overall resource usage in the distributed computing environment.

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.

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.

Abstract: Implementing a fair share of resources among one or more scheduling peers. Resource allocations are received for a plurality of scheduling peers. For each scheduling peer, a usage percentage difference is determined between their respective usage percentage and configured share ratio. For a first competing peer that is served more than a second competing peer, resource allocation is adjusted such that resources from the first competing peer are allocated to the second competing peer based, at least in part, on a time decay factor function that gives less weight to the usage percentage difference as an age of the usage percentage difference increases.

Abstract: A technique for operating a grid includes receiving, by a resource manager executing on a data processing system of the grid, an allocation request from a first application for one or more resources. The resource manager determines whether a service that is in standby mode is available for utilization by the first application. In response to the service that is standby mode being available for utilization by the first application, the resource manager assigns one or more resources associated with the service and the service to the first application.

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.

Abstract: A computer processor allocates a service instance to a first resource of a resource pool, in which the service instance corresponds to performing a first task and for the service instance to continue to occupy the first resource subsequent to task completion, and determines the first resource to be idle. The first resource is returned to a resource pool, with the service instance occupying the first resource as a global standby service instance of a first service. In response to a request of a resource to perform a task from a second application, in which the request for the resource includes a global name associated with the first service of the global standby service instance, occupying the first resource returned to the resource pool, allocating from the resource pool, the first resource occupied by the global standby service instance, based on the global name associated with the first service.

Abstract: Implementing a fair share of resources among one or more scheduling peers. Resource allocations are received for a plurality of scheduling peers. For each scheduling peer, a usage percentage difference is determined between their respective usage percentage and configured share ratio. For a first competing peer that is served more than a second competing peer, resource allocation is adjusted such that resources from the first competing peer are allocated to the second competing peer based, at least in part, on a time decay factor function that gives less weight to the usage percentage difference as an age of the usage percentage difference increases.

Abstract: Embodiments for optimizing resource usage in a distributed computing environment. Resource usage of each task in a set of running tasks associated with a job is monitored to collect resource usage information corresponding to each respective task. A resource unit size of at least one resource allocated to respective tasks in the set of running tasks is adjusted based on the resource usage information to improve overall resource usage in the distributed computing environment.

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.

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.

Abstract: A technique for operating a grid includes receiving, by a resource manager executing on a data processing system of the grid, an allocation request from a first application for one or more resources. The resource manager determines whether a service that is in standby mode is available for utilization by the first application. In response to the service that is standby mode being available for utilization by the first application, the resource manager assigns one or more resources associated with the service and the service to the first application.

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: 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: 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.

Abstract: A computer processor allocates a service instance to a first resource of a resource pool, in which the service instance corresponds to performing a first task and for the service instance to continue to occupy the first resource subsequent to task completion, and determines the first resource to be idle. The first resource is returned to a resource pool, with the service instance occupying the first resource as a global standby service instance of a first service. In response to a request of a resource to perform a task from a second application, in which the request for the resource includes a global name associated with the first service of the global standby service instance, occupying the first resource returned to the resource pool, allocating from the resource pool, the first resource occupied by the global standby service instance, based on the global name associated with the first service.

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.

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.