# US 2025/0086016 A1 · Scheduling optimization for containerized instances

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0086016 A1
- Document ID: US20250086016A1
- Status: Published application
- Kind: A1
- Application number: 18/463,828
- Filed: 2023-09-08
- Published: 2025-03-13
- Earliest claimed: 2023-09-08
- Assignees: Red Hat, Inc.
- Applicants: Red Hat, Inc.
- Inventors: Alberto Falossi; Yehoshua Salomon
- Web page: https://patentgrep.com/patent/US20250086016A1

## CPC

- G06F 9/5033: {considering data affinity}
- G06F 9/5088: {involving task migration}
- G06F 9/455: Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06N 20/00: Machine learning
- G06F 2009/4557: {Distribution of virtual machine instances; Migration and load balancing}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A computing device determines a state of each containerized instance of containerized instances executing on a compute node in a cluster of compute nodes. The computing device determines a state of each compute node in the cluster. The computing device calculates, for each respective compute node in the cluster, a cost associated with each containerized instance on the respective compute node based on the state of each containerized instance and the state of each compute node. The computing device creates a list of preferred compute nodes for each containerized instance to execute on based on the state of each containerized instance, the state of each compute node, and the cost associated with each containerized instance for each compute node in the cluster. The computing device causes, based on the list, a first containerized instance of the containerized instances to be moved to a first compute node identified in the list.

## Claims

### Claim 1

A method, comprising:
determining, by a container orchestration system (COS) executing on a computing device, a first current state of each containerized instance of a plurality of containerized instances executing on a compute node in a cluster of compute nodes;
determining, by the COS, a first current state of each compute node in the cluster of compute nodes;
calculating, by the COS, for each respective compute node in the cluster of compute nodes, a first cost associated with each containerized instance on the respective compute node based on the first current state of each containerized instance and the first current state of each compute node;
creating, by the COS, a list of preferred compute nodes for each containerized instance to execute on based on the first current state of each containerized instance, the first current state of each compute node, and the first cost associated with each containerized instance for each compute node in the cluster of compute nodes; and
causing, by the COS based on the list of preferred compute nodes, a first containerized instance of the plurality of containerized instances to be moved to a first compute node identified in the list of preferred compute nodes.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
determining that a second containerized instance of the plurality of containerized instances is to be initiated on a compute node in the cluster of compute nodes;
accessing the list of preferred compute nodes; and
causing the second containerized instance to be initiated on a second compute node in the cluster of compute nodes based on the list of preferred compute nodes.

### Claim 3 (depends on 2)

The method of claim 2, further comprising:
prior to accessing the list of preferred compute nodes, determining a second current state of each containerized instance of the plurality of containerized instances executing on a compute node in the cluster of compute nodes;
determining a second current state of each compute node in the cluster of compute nodes;
calculating, for each respective compute node in the cluster of compute nodes, a second cost associated with each containerized instance on the respective compute node based on the second current state of each containerized instance and the second current state of each compute node; and
updating the list of preferred compute nodes for each containerized instance to execute on based on the second current state of each containerized instance, the second current state of each compute node, and the second cost associated with each containerized instance for each compute node in the cluster of compute nodes.

### Claim 4 (depends on 1)

The method of claim 1, wherein determining the first current state of each containerized instance of the plurality of containerized instances executing on a compute node in the cluster of compute nodes comprises obtaining, from each containerized instance of the plurality of containerized instances, resources of each respective containerized instance of the plurality of containerized instances.

### Claim 5 (depends on 1)

The method of claim 1, wherein determining the first current state of each compute node in the cluster of compute nodes comprises obtaining, from each compute node in the cluster of compute nodes, resources of each respective compute node in the cluster of compute nodes.

### Claim 6 (depends on 1)

The method of claim 1, wherein calculating, for each respective compute node in the cluster of compute nodes, the first cost associated with each containerized instance on the respective compute node based on the first current state of each containerized instance and the first current state of each compute node comprises:
determining costs for each containerized instance with the respective first current state to execute on the respective compute node in the cluster of compute nodes with the respective first current state;
determining costs for the respective compute node with the respective first current state to execute in the cluster of compute nodes;
determining costs to move each containerized instance to the respective compute node; and
calculating, for the respective compute node, the first cost associated with each containerized instance on the respective compute node based on the costs for each containerized instance, the costs for the respective compute node, and the costs to move each containerized instance to the respective compute node.

### Claim 7 (depends on 6)

The method of claim 6, wherein:
the costs for each containerized instance with the respective first current state to execute on the respective compute node in the cluster of compute nodes comprise computing resources for executing the respective containerized instance on the respective compute node in the cluster of compute nodes;
the costs for the respective compute node with the respective first current state to execute in the cluster of compute nodes comprise computing resources for executing the respective compute node in the cluster of compute nodes; and
the costs to move each containerized instance to the respective compute node comprise computing resources to move the respective containerized instance to the respective compute node.

### Claim 8 (depends on 1)

The method of claim 1, wherein creating the list of preferred compute nodes for each containerized instance to execute on based on the first current state of each containerized instance, the first current state of each compute node, and the first cost associated with each containerized instance for each compute node in the cluster of compute nodes comprises:
receiving, by a machine-learned model, the first current state of each containerized instance, the first current state of each compute node, and the first cost associated with each containerized instance for each compute node in the cluster of compute nodes;
determining, by the machine-learned model, a policy for each containerized instance based on the first current state of each containerized instance, the first current state of each compute node, and the first cost associated with each containerized instance for each compute node in the cluster of compute nodes; and
outputting, by the machine-learned model, the list of preferred compute nodes based on the policy.

### Claim 9 (depends on 8)

The method of claim 8, wherein the machine-learned model comprises a reinforcement learning algorithm.

### Claim 10 (depends on 9)

The method of claim 9, further comprising:
determining, by the reinforcement learning algorithm based on the first current state of each containerized instance, the first current state of each compute node, and the first cost associated with each containerized instance for each compute node in the cluster of compute nodes, actions to improve one or more of the first current state of each containerized instance and the first current state of each compute node.

### Claim 11 (depends on 1)

The method of claim 1, wherein the list of preferred compute nodes comprises a list of a preferred compute node in the cluster of compute nodes for each containerized instance of the plurality of containerized instances.

### Claim 12 (depends on 1)

The method of claim 1, further comprising:
obtaining a performance constraint associated with the first current state of each containerized instance;
wherein creating the list of preferred compute nodes for each containerized instance to execute on comprises creating the list of preferred compute nodes for each containerized instance to execute on based on the first current state of each containerized instance, the first current state of each compute node, the first cost associated with each containerized instance for each compute node in the cluster of compute nodes, and the performance constraint.

### Claim 13 (depends on 1)

The method of claim 1, further comprising:
obtaining a performance constraint associated with the first cost associated with each containerized instance for each compute node in the cluster of compute nodes;
wherein creating the list of preferred compute nodes for each containerized instance to execute on comprises creating the list of preferred compute nodes for each containerized instance to execute on based on the first current state of each containerized instance, the first current state of each compute node, the first cost associated with each containerized instance for each compute node in the cluster of compute nodes, and the performance constraint.

### Claim 14 (depends on 1)

The method of claim 1, further comprising:
determining a change in resources available on one or more compute nodes in the cluster of compute nodes;
in response to determining the change in resources available, determining a second current state of each containerized instance of the plurality of containerized instances executing on a compute node in the cluster of compute nodes;
determining a second current state of each compute node in the cluster of compute nodes;
calculating, for each respective compute node in the cluster of compute nodes, a second cost associated with each containerized instance on the respective compute node based on the second current state of each containerized instance and the second current state of each compute node; and
updating the list of preferred compute nodes for each containerized instance to execute on based on the second current state of each containerized instance, the second current state of each compute node, and the second cost associated with each containerized instance for each compute node in the cluster of compute nodes.

### Claim 15 (depends on 14)

The method of claim 14, wherein updating the list of preferred compute nodes for each containerized instance to execute on comprises:
receiving, by a machine-learned model, the second current state of each containerized instance, the second current state of each compute node, and the second cost associated with each containerized instance for each compute node in the cluster of compute nodes;
determining, by the machine-learned model, a policy for each containerized instance based on the second current state of each containerized instance, the second current state of each compute node, and the second cost associated with each containerized instance for each compute node in the cluster of compute nodes; and
outputting, by the machine-learned model, the list of preferred compute nodes based on the policy.

### Claim 16

A computing device, comprising:
a memory; and
a processor device coupled to the memory, the processor device to:
determine a first current state of each containerized instance of a plurality of containerized instances executing on a compute node in a cluster of compute nodes;
determine a first current state of each compute node in the cluster of compute nodes;
calculate, for each respective compute node in the cluster of compute nodes, a first cost associated with each containerized instance on the respective compute node based on the first current state of each containerized instance and the first current state of each compute node;
create a list of preferred compute nodes for each containerized instance to execute on based on the first current state of each containerized instance, the first current state of each compute node, and the first cost associated with each containerized instance for each compute node in the cluster of compute nodes; and
cause, based on the list of preferred compute nodes, a first containerized instance of the plurality of containerized instances to be moved to a first compute node identified in the list of preferred compute nodes.

### Claim 17 (depends on 16)

The computing device of claim 16, wherein the processor device is further to:
determine that a second containerized instance of the plurality of containerized instances is to be initiated on a compute node in the cluster of compute nodes;
access the list of preferred compute nodes; and
cause the second containerized instance to be initiated on a second compute node in the cluster of compute nodes based on the list of preferred compute nodes.

### Claim 18 (depends on 16)

The computing device of claim 16, wherein the processor device is further to:
prior to accessing the list of preferred compute nodes, determine a second current state of each containerized instance of the plurality of containerized instances executing on a compute node in the cluster of compute nodes;
determine a second current state of each compute node in the cluster of compute nodes;
calculate, for each respective compute node in the cluster of compute nodes, a second cost associated with each containerized instance on the respective compute node based on the second current state of each containerized instance and the second current state of each compute node; and
update the list of preferred compute nodes for each containerized instance to execute on based on the second current state of each containerized instance, the second current state of each compute node, and the second cost associated with each containerized instance for each compute node in the cluster of compute nodes.

### Claim 19 (depends on 16)

The computing device of claim 16, wherein, to calculate, for each respective compute node in the cluster of compute nodes, the first cost associated with each containerized instance on the respective compute node based on the first current state of each containerized instance and the first current state of each compute node, the processor device is further to:
determine costs for each containerized instance with the respective first current state to execute on the respective compute node in the cluster of compute nodes with the respective first current state;
determine costs for the respective compute node with the respective first current state to execute in the cluster of compute nodes;
determine costs to move each containerized instance to the respective compute node; and
calculate, for the respective compute node, the first cost associated with each containerized instance on the respective compute node based on the costs for each containerized instance, the costs for the respective compute node, and the costs to move each containerized instance to the respective compute node.

### Claim 20

A non-transitory computer-readable storage medium that includes computer-executable instructions that, when executed, cause one or more processor devices to:
determine a first current state of each containerized instance of a plurality of containerized instances executing on a compute node in a cluster of compute nodes;
determine a first current state of each compute node in the cluster of compute nodes;
calculate for each respective compute node in the cluster of compute nodes, a first cost associated with each containerized instance on the respective compute node based on the first current state of each containerized instance and the first current state of each compute node;
create a list of preferred compute nodes for each containerized instance to execute on based on the first current state of each containerized instance, the first current state of each compute node, and the first cost associated with each containerized instance for each compute node in the cluster of compute nodes; and
cause, based on the list of preferred compute nodes, a first containerized instance of the plurality of containerized instances to be moved to a first compute node identified in the list of preferred compute nodes.
