Abstract: A method of communicating time correlated vector data within a network includes reading, by a transmitting node, a first vector data including a plurality of elements, selecting, by the transmitting node, a subset of elements of the plurality of elements based on a criteria and sending, by the transmitting node, the subset of elements to a receiving node. The receiving node receives the subset of elements and estimates a plurality of elements not included in the subset of elements based on a previously received subset of element based on a second vector data. The first vector data and the second vector data are part of a time series of vectors.

Abstract: Resource scheduling methods and a resource manager define leaf buckets, each of which have coordinates in corresponding dimensions in a coordinate space. Nodes having resource values in the corresponding dimensions are mapped on the leaf buckets. A task request identifies candidate nodes and requested resources that relate to the coordinate space dimensions. The leaf buckets are scanned to find a fittable node among the list of candidates. A result of the scan is stored in a positive or a negative cache entry. When a next task request of a same task group is received, scanning of the leaf buckets is performed using information from the positive or negative cache entry. For a positive cache entry, the scanning is initiated from a point where the previous scanning has ended. For a negative cache entry, the scanning ignores nodes that were found not to contain the requested resources in the previous scanning.

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: The disclosed apparatuses and methods are directed to resource scheduling of resource nodes of a computer cluster or a cloud computing platform. The disclosed method comprises receiving node identifiers of nodes of a node set and receiving values of node attributes for each one of node identifiers; receiving a sequence of tasks, each specifying values of task parameters; generating a node graph structure having at least one graph structure vertex mapped to a coordinate space; mapping each task to the coordinate space; determining a first node identifier of a first node by analyzing the at least node graph structure vertex located within a fittable area for each task; and mapping the first node identifier to each task to generate a scheduling scheme.

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: In a distributed computing network, requests for allocation of resources to tenant workloads and messages identifying resource availability are received and aggregated. Resources are allocated to the workloads in accordance with a distribution policy defining values for resource entitlements of the tenants. The values include pre-emption quantities. In response to determining that a quantity of resources allocated for workloads of a first tenant is less than the tenant's pre-emption quantity, processing of another workload from a second tenant is interrupted to re-allocate resources from the second tenant's workload to the first tenant's workload.

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: Methods and systems of managing a resource in a distributed resource management system can include: receiving a resource request including data identifying at least one requested resource attribute; identifying one or more candidate resources from a plurality of resources by performing element-wise operations on one or more resource attribute element sets corresponding to the at least one requested resource attribute, each resource attribute element set comprising an element for each of the plurality of resources, each element representing a resource attribute for a respective resource of the plurality of resources; and scheduling a workload associated with the resource request for execution based on the one or more identified candidate resources.

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: Methods and systems of managing workloads and resources for tenants structured as a hierarchical tenant queue defining a resource distribution policy. The tenants are modified and the system responds with dynamic adjustments to the hierarchical tenant queue and workload distribution. A rule-based workload management engine defines rules for actions for the workload to respond to the dynamic update.

Abstract: Methods and systems of managing a resource in a distributed resource management system can include: monitoring, by at least one processor, utilization of the resource being used by at least one workload; and performing an enforcement action on a particular workload of the at least one workload when a utilization condition is met, and when the particular workload has a current resource utilization exceeding its associated resource allocation limit.

Abstract: Methods and systems of managing workloads and resources for tenants structured as a hierarchical tenant queue defining a resource distribution policy. The tenants are modified and the system responds with dynamic adjustments to the hierarchical tenant queue and workload distribution. A rule-based workload management engine defines rules for actions for the workload to respond to the dynamic update.

Abstract: Methods and systems of managing a resource in a distributed resource management system can include: receiving a resource request including data identifying at least one requested resource attribute; identifying one or more candidate resources from a plurality of resources by performing element-wise operations on one or more resource attribute element sets corresponding to the at least one requested resource attribute, each resource attribute element set comprising an element for each of the plurality of resources, each element representing a resource attribute for a respective resource of the plurality of resources; and scheduling a workload associated with the resource request for execution based on the one or more identified candidate resources.

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: In a distributed computing network, requests for allocation of resources to tenant workloads and messages identifying resource availability are received and aggregated. Resources are allocated to the workloads in accordance with a distribution policy defining values for resource entitlements of the tenants. The values include pre-emption quantities. In response to determining that a quantity of resources allocated for workloads of a first tenant is less than the tenant's pre-emption quantity, processing of another workload from a second tenant is interrupted to re-allocate resources from the second tenant's workload to the first tenant's workload.

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