G06F2209/506

DYNAMIC LOAD BALANCING OF OPERATIONS FOR REAL-TIME DEEP LEARNING ANALYTICS
20220035684 · 2022-02-03 ·

Apparatuses, systems, and techniques to balance processing load between a plurality of hardware accelerators. In at least one embodiment, operations performed on batches of frames of a video (e.g., as part of a video analytics pipeline) are distributed by a load balancer between a first hardware accelerator and a second hardware accelerator.

NON-LINEAR MANAGEMENT OF REAL TIME SEQUENTIAL DATA IN CLOUD INSTANCES VIA TIME CONSTRAINTS
20220035724 · 2022-02-03 ·

Non-linear management of real time sequential data in cloud instances via time constraints is provided by: receiving, at a cloud network facility from a media production facility, a selection of component media flows for assembly into an assembled media package; identifying a time constraint for assembling component media flows into the assembled media package; identifying processes to perform with respect to the component media flows during assembly of the assembled media package; in response to an estimated time to perform the processes with respect to the component media flows exceeding the time constraint, adjusting performance of the processes with respect to the component media flows to increase a speed of performance; and performing, in the cloud network facility, the processes with respect to the component media flows as adjusted to produce the assembled media package.

Specifying behavior among a group of computing tasks

A method of specifying behavior among a group of computing tasks included in a request to be performed in a domain of computing resources is disclosed. Method steps include receiving, at a scheduler operably coupled to the domain, a p/f request, the received p/f request including a first group and a first relationship, the first group comprising at least a first p/f group element and a second p/f group element, the first relationship defining a desired behavior of the first and second p/f group elements with respect to each other during performance of the p/f request; determining whether the domain includes available computing resources capable of satisfying the first relationship; and in response to a determination that the domain includes available computing resources capable of satisfying the first relationship, allocating, with the scheduler, at least one available computing resource to fulfill the p/f request.

Executing instruction sequence code blocks by using virtual cores instantiated by partitionable engines
09766893 · 2017-09-19 · ·

A method for executing instructions using a plurality of virtual cores for a processor. The method includes receiving an incoming instruction sequence using a global front end scheduler, and partitioning the incoming instruction sequence into a plurality of code blocks of instructions. The method further includes generating a plurality of inheritance vectors describing interdependencies between instructions of the code blocks, and allocating the code blocks to a plurality of virtual cores of the processor, wherein each virtual core comprises a respective subset of resources of a plurality of partitionable engines. The code blocks are executed by using the partitionable engines in accordance with a virtual core mode and in accordance with the respective inheritance vectors.

FLEXIBLE BINDING OF TASKS TO TARGET RESOURCES
20170262320 · 2017-09-14 ·

A system according to one exemplary embodiment comprises: a processor; and memory coupled to the processor and storing instructions that, when executed by the processor, cause the system to: receive, by a software component operating on the system: a set of actions, an identification of a set of computing resources to associate with the set of actions, and a set of dependencies among the plurality of actions for executing the actions using the computing resources; associate the set of actions and data elements related to the set of actions, by the software component, with the set of computing resources; and order, by the software component, each respective action in the set of actions for execution on the computing resources.

TASK MAPPING FOR HETEROGENEOUS PLATFORMS
20170262319 · 2017-09-14 ·

An exemplary system according to various examples receives a function call including a plurality of operands, each operand in the plurality of operands comprising a set of data elements. The system identifies a plurality of actions associated with the function call and the plurality of operands, determines a set of dependencies among the plurality of actions for executing the actions using a set of computing resources, and presents the set of actions and the determined set of dependencies.

Controlling data processing tasks

Information representative of a graph-based program specification has a plurality of components, each of which corresponds to a task, and directed links between ports of said components. A program corresponding to said graph-based program specification is executed. A first component includes a first data port, a first control port, and a second control port. Said first data port is configured to receive data to be processed by a first task corresponding to said first component, or configured to provide data that was processed by said first task corresponding to said first component. Executing a program corresponding to said graph-based program specification includes: receiving said first control information at said first control port, in response to receiving said first control information, determining whether or not to invoke said first task, and after receiving said first control information, providing said second control information from said second control port.

AFFINITY AND ANTI-AFFINITY WITH CONSTRAINTS FOR SETS OF RESOURCES AND SETS OF DOMAINS IN A VIRTUALIZED AND CLUSTERED COMPUTER SYSTEM

An example method of placing resources in domains of a virtualized computing system is described. A host cluster includes a virtualization layer executing on hardware platforms of the hosts. The method includes: determining, at a virtualization management server, definitions of the domains and resource groups, each of the domains including a plurality of placement targets, each of the resource groups including a plurality of the resources; receiving, at the virtualization management server from the user, affinity/anti-affinity rules that control placement of the resource groups within the domains; receiving, at the virtualization management server from the user, constraints that further control placement of the resource groups within the domains; and placing, by the virtualization management server, the resource groups within the domains based on the affinity/anti-affinity rules and the constraints.

AFFINITY AND ANTI-AFFINITY FOR SETS OF RESOURCES AND SETS OF DOMAINS IN A VIRTUALIZED AND CLUSTERED COMPUTER SYSTEM
20220237048 · 2022-07-28 ·

An example method of placing resources in domains in a virtualized computing system is described. A host cluster includes a virtualization layer executing on hardware platforms of the hosts. The method includes: determining, at a virtualization management server, definitions of the domains and resource groups, each of the domains including a plurality of placement targets, each of the resource groups including a plurality of the resources; receiving, at the virtualization management server from the user, affinity/anti-affinity rules that control placement of the resource groups within the domains; and placing, by the virtualization management server, the resource groups within the domains based on the affinity/anti-affinity rules.

AUTOMATICALLY MANAGING PERFORMANCE OF SOFTWARE IN A DISTRIBUTED COMPUTING ENVIRONMENT
20210399957 · 2021-12-23 ·

Software performance can be automatically managed in a distributed computing environment. In one example, a system that can receive metrics information describing resource usage by a first instance of a service in a distributed computing environment. The system can also determine a quality-of-service (QoS) constraint for the service. The system can then modify a definition file based on the metrics information and the QoS constraint, the definition file being configured for deploying instances of the service in the distributed computing environment. The system can deploy a second instance of the service in the distributed computing environment using the modified definition file. As a result, the second instance can more closely satisfy the QoS constraint than the first instance.