# US 2026/0037514 A1 · Dynamic workload management optimizations using real-time execution feedback

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

- Number: US 2026/0037514 A1
- Document ID: US20260037514A1
- Status: Published application
- Kind: A1
- Application number: 19/346,542
- Filed: 2025-09-30
- Published: 2026-02-05
- Earliest claimed: 2023-05-23
- Assignees: Microsoft Technology Licensing, LLC
- Applicants: Microsoft Technology Licensing, LLC
- Inventors: Milan POTOCNIK; Sumeet Priyadarshee DASH; Jose AGUILAR SABORIT; Krishnan SRINIVASAN; Raghunath RAMAKRISHNAN
- Web page: https://patentgrep.com/patent/US20260037514A1

## CPC

- G06F 16/24545: {Selectivity estimation or determination}
- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F 9/5027: {the resource being a machine, e.g. CPUs, Servers, Terminals}
- G06F 9/505: {considering the load}
- G06F 9/5066: {Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs (mappping at compile time, see G06F8/451)}
- G06F 16/24532: {of parallel queries}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Systems and methods are provided that introduce an approach for executing a multi-query workload that leverages live execution feedback from nodes to detect resourcing issues and anomalies, and deploy real-time corrective measures for the multi-query workload. Leveraging live execution feedback from the nodes as the queries are executing make it possible to detect various resourcing issues and anomalies, and enable the system to perform corrective actions “live” or in “real-time” during an execution of a query, and more specifically during execution of the tasks within a query.

## Claims

### Claim at position 1

-20. (canceled)

### Claim 21

A method comprising:
receiving a query;
identifying a plurality of tasks to execute the query, the plurality of tasks comprising a first task and a second task that depends from the first task;
providing a first estimation of a first amount of resources to be used to execute the first task;
providing a second estimation of a second amount of resources to be used to execute the second task;
based at least on the first estimation and the second estimation, assigning the first task to a first plurality of nodes and the second task to a second plurality of nodes; and
prior to the second task on the second plurality of nodes being executed:
receiving, from the first plurality of nodes, an actual amount of resources used to execute the first task; and
based at least on the actual amount of the resources used to execute the first task, adjusting the second estimation of the second amount of resources to be used to execute the second task by adjusting an estimated amount of resources on a first node in the second plurality of nodes by a first number and adjusting a estimated amount of resources on a second node in the second plurality of nodes by a second number.

### Claim 22 (depends on 21)

The method according to claim 21, wherein the first number is different than the second number.

### Claim 23 (depends on 21)

The method according to claim 21, wherein adjusting the second estimation of the second amount of resources comprises one of the following: increasing the second amount of resources in the second estimation when the actual amount of resources used to execute the first task is greater than the first estimation of the first amount of resources.

### Claim 24 (depends on 21)

The method according to claim 21, wherein adjusting the second estimation of the second amount of resources comprises decreasing the second amount of resources in the second estimation when the actual amount of resources used to execute the first task is less than the first estimation of the first amount of resources.

### Claim 25 (depends on 21)

The method according to claim 21, wherein each task in the plurality of tasks has a resource demand comprising: a central processing unit demand, a memory demand, and a disk demand,
wherein each node in the first plurality of nodes and each node in the second plurality of nodes have a resource capacity comprising: a central processing unit capacity, a memory capacity, and a disk cost; and
wherein assigning the first task to the first plurality of nodes and the second task to the second plurality of nodes is based at least on the resource demand of each of the first task and the second task and the resource capacity of each node in the first plurality of nodes and each node in the second plurality of nodes.

### Claim 26 (depends on 21)

The method according to claim 21, further comprising:
identifying a degree of parallelism for the first task, the degree of parallelism indicating how many different nodes the first task can be executed on; and
based on the identifying, assigning the first task to the first plurality of nodes.

### Claim 27 (depends on 21)

The method according to claim 21, wherein the actual amount of resources used to execute the first task is received in real-time from the first node using a dedicated communication channel.

### Claim 28

A system comprising:
a distributed query processor;
a query optimizer;
a cluster of nodes; and
a memory comprising computer-readable media that, when executed by the distributed query processor, cause the distributed query processor to perform the following operations:
receiving a query;
identifying a plurality of tasks to execute the query, the plurality of tasks comprising a first task and a second task that depends from the first task;
receiving, from the query optimizer, a first estimation of a first amount of resources to be used to execute the first task;
receiving, from the query optimizer, a second estimation of a second amount of resources to be used to execute the second task;
based at least on the first estimation and the second estimation, assigning the first task to a first plurality of nodes in the cluster of nodes and the second task to a second plurality of nodes in the cluster nodes; and
prior to the second task on the second plurality of nodes being executed:
receiving, from the first plurality of nodes, an actual amount of resources used to execute the first task; and
based at least on the actual amount of the resources used to execute the first task, adjusting the second estimation of the second amount of resources to be used to execute the second task by adjusting an estimated amount of resources on a first node in the second plurality of nodes by a first number and adjusting a estimated amount of resources on a second node in the second plurality of nodes by a second number.

### Claim 29 (depends on 28)

The system of claim 28, wherein the first number is different than the second number.

### Claim 30 (depends on 28)

The system of claim 28, wherein adjusting the second estimation of the second amount of resources comprises one of the following: increasing the second amount of resources in the second estimation when the actual amount of resources used to execute the first task is greater than the first estimation of the first amount of resources, or decreasing the second amount of resources in the second estimation when the actual amount of resources used to execute the first task is less than the first estimation of the first amount of resources.

### Claim 31 (depends on 28)

The system of claim 28, wherein each task in the plurality of tasks has a resource demand comprising: a central processing unit demand, a memory demand, and a disk demand.

### Claim 32 (depends on 31)

The system of claim 31, wherein each node in the first plurality of nodes and each node in the second plurality of nodes have a resource capacity comprising: a central processing unit capacity, a memory capacity, and a disk cost capacity; and
wherein assigning the first task to the first plurality of nodes and the second task to the second plurality of nodes is based at least on the resource demand of each of the first task and the second task and the resource capacity of each node in the first plurality of nodes and each node in the second plurality of nodes.

### Claim 33 (depends on 28)

The system of claim 28, wherein the actual amount of resources used to execute the first task is different than the first estimation of the first amount of resources.

### Claim 34 (depends on 28)

The system of claim 28, further comprising:
a first dedicated communication channel coupled between the distributed query processor and the first node; and
a second dedicated communication channel coupled between the distributed query processor and the second node,
wherein the actual amount of resources used to execute the first task is received in real-time from the first node using the first dedicated communication channel.

### Claim 35

One or more computer storage media comprising computer-executable instruction that, when executed by a processor, cause the processor to perform the following operations:
receiving a query;
identifying a plurality of tasks to execute the query, the plurality of tasks comprising a first task and a second task that depends from the first task;
providing a first estimation of a first amount of resources to be used to execute the first task;
providing a second estimation of a second amount of resources to be used to execute the second task;
based at least on the first estimation and the second estimation, assigning the first task to a first plurality of nodes and the second task to a second plurality of nodes; and
prior to the second task on the second plurality of nodes being executed:
receiving, from the first plurality of nodes, an actual amount of resources used to execute the first task; and
based at least on the actual amount of the resources used to execute the first task, adjusting the second estimation of the second amount of resources to be used to execute the second task by adjusting an estimated amount of resources on a first node in the second plurality of nodes by a first number and adjusting a estimated amount of resources on a second node in the second plurality of nodes by a second number.

### Claim 36 (depends on 35)

The one or more computer storage media of claim 35, wherein the first number is different than the second number.

### Claim 37 (depends on 36)

The one or more computer storage media of claim 36, wherein the actual amount of resources used to execute the first task is different than the first estimation of the first amount of resources.

### Claim 38 (depends on 37)

The one or more computer storage media of claim 37, wherein adjusting the second estimation of the second amount of resources comprises one of the following: increasing the second amount of resources in the second estimation when the actual amount of resources used to execute the first task is greater than the first estimation of the first amount of resources, or decreasing the second amount of resources in the second estimation when the actual amount of resources used to execute the first task is less than the first estimation of the first amount of resources.

### Claim 39 (depends on 35)

The one or more computer storage media of claim 35, wherein each task in the plurality of tasks has a resource demand comprising: a central processing unit demand, a memory demand, and a disk demand:
wherein each node in the first plurality of nodes and each node in the second plurality of nodes have a resource capacity comprising: a central processing unit capacity, a memory capacity, and a disk cost capacity; and
wherein assigning the first task to the first plurality of nodes and the second task to the second plurality of nodes is based at least on the resource demand of each of the first task and the second task and the resource capacity of each node in the first plurality of nodes and each node in the second plurality of nodes.

### Claim 40 (depends on 35)

The one or more computer storage media of claim 35, wherein the computer-executable instructions further cause the processor to perform the following operations:
identifying a degree of parallelism for the first task, the degree of parallelism indicating how many different nodes the first task can be executed on; and
based on the identifying, assigning the first task to the first plurality of nodes.
