International Business Machines Corporation

Alicia Elena Chin

Zhenhua Hu

Yonggang Hu

Zhimin Lin

Jason T S Lam

Li Feng Zhang

Jian Tan

Michael Feiman

Ajith Shanmuganathan

Xiaoqiao Meng

Shicong Meng

Hao Zhou

Amir Asif

Vida Movahedi

Lei Su

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.

Minimizing service restart by optimally resizing service pools

A computer-implemented method, according to one embodiment, includes: splitting a video stream into a plurality of sub-streams, and encoding each of the sub-streams. A packet is also transmitted to a receiver, where the packet includes a number of the encoded sub-streams. Moreover, the number of the encoded sub-streams that are included in the packet transmitted to the receiver corresponds to a quality of service associated with a service cost incurred by the receiver. Other systems, methods, and computer program products are described in additional embodiments.

Video encoding and transcoding for multiple simultaneous qualities of service

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.

Computing session workload scheduling and management of parent-child tasks using a blocking yield API to block and unblock the parent task

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.

Hierarchical fairshare of multi-dimensional resources

A computer-implemented method, according to one embodiment, includes: splitting a video stream into a plurality of sub-streams. Each of the sub-streams individually provide a unique version of the video stream having a lower video quality. However, merging more than one of the sub-streams provides a merged version of the video stream having a relatively higher video quality. Each of the sub-streams are also encoded. A packet which includes a number of the encoded sub-streams is transmitted to a receiver, where the number of the encoded sub-streams included in the packet transmitted to the receiver corresponds to a quality of service associated with a service cost incurred by the receiver. Other systems, methods, and computer program products are described in additional embodiments.

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.

Usage-aware standby service in a grid environment

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.

A computer-implemented method, according to one embodiment, includes: splitting a video stream into a plurality of sub-streams, encoding each of the sub-streams in parallel, and transmitting a packet to a receiver, wherein the packet includes a number of the encoded sub-streams. Each of the sub-streams individually provide a unique version of the video stream having a lower video quality, while merging more than one of the sub-streams provides a merged version of the video stream having a relatively higher video quality. Moreover, the number of the encoded sub-streams included in the packet transmitted to the receiver corresponds to a quality of service associated with the receiver. Other systems, methods, and computer program products are described in additional embodiments.

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.

Methods and arrangements for assembling tasks in a progressive queue. At least one job is received, each job comprising a dependee set of tasks and a depender set of at least one task. The dependee tasks are assembled in a progressive queue for execution, and the dependee tasks are executed. Other variants and embodiments are broadly contemplated herein.

Interleave-scheduling of correlated tasks and backfill-scheduling of depender tasks into a slot of dependee tasks

Methods and arrangements for yielding resources in data processing. At least one job is received, each job comprising a dependee set of tasks and a depender set of at least one task, and the at least one of the dependee set of tasks is executed. At least one resource of the at least one of the dependee set of tasks is yielded upon detection of resource underutilization in at least one other location. Other variants and embodiments are broadly contemplated herein. Other variants and embodiments are broadly contemplated herein.

Detection of time points to voluntarily yield resources for context switching

Methods and arrangements for managing data segments. At least one job is received, each job comprising a dependee set of tasks and a depender set of at least one task, and the at least one of the dependee set of tasks is executed. There is extracted, from the at least one of the dependee set of tasks, at least one service common to at least another of the dependee set of tasks. Other variants and embodiments are broadly contemplated herein.

Managing data segments in memory for context switching with standalone fetch and merge services

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.

Growing community of inventors

Markham, Canada

Alicia Elena Chin