# US 2026/0089115 A1 · On demand scheduling for forwarding a computation result of an endpoint processing unit through a network connecting several endpoint processing units

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

- Number: US 2026/0089115 A1
- Document ID: US20260089115A1
- Status: Published application
- Kind: A1
- Application number: 19/227,479
- Filed: 2025-06-04
- Published: 2026-03-26
- Earliest claimed: 2024-09-21
- Assignees: Delos Data Inc.
- Applicants: Delos Data Inc.
- Inventors: Daniel P. Daly; Edward V. E. Doe; Alain J. E. Gravel
- Web page: https://patentgrep.com/patent/US20260089115A1

## CPC

- H04L 45/24: Multipath
- 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/5083: {Techniques for rebalancing the load in a distributed system}
- G06F 9/547: {Remote procedure calls [RPC]; Web services}
- H04L 45/123: {Evaluation of link metrics (techniques for monitoring network metrics H04L43/08)}
- H04L 47/33: using forward notification
- H04L 67/10: in which an application is distributed across nodes in the network (software deployment G06F8/60; multiprogramming arrangements G06F9/46)
- H04L 67/1001: for accessing one among a plurality of replicated servers
- H04L 67/60: Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources (admission control or resource allocation H04L47/70)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Some embodiments provide a method of scheduling a forwarding of a first result of a first operation executed by the first endpoint processing unit (EPU) to a second EPU along a network connecting a plurality of EPUs. At the first EPU, the method forwards, for the first result, a scheduling request as an in-band control message through the network that forwards between the EPUs data message flows that store results of operations executed by the EPUs. In response to the scheduling request, the method receives a set of scheduling parameters from a control plane agent that obtains the in-band forwarded control message and provides the set of scheduling parameters back to the first EPU in an in-band reply message. The method uses the set of scheduling parameters to forward the result of the operation to the second EPU through the network.

## Claims

### Claim 1

A method of scheduling a forwarding of a first result of a first operation executed by the first endpoint processing unit (EPU) to a second EPU along a network connecting a plurality of EPUs, the method comprising:
at the first EPU:
forwarding, for the first result, a scheduling request as an in-band control message through the network that forwards between the EPUs data message flows that store results of operations executed by the EPUs;
in response to the scheduling request, receiving a set of scheduling parameters from a control plane agent that obtains the in-band forwarded control message and provides the set of scheduling parameters back to the first EPU in an in-band reply message; and
using the set of scheduling parameters to forward the result of the operation to the second EPU through the network.

### Claim 2 (depends on 1)

The method of claim 1, wherein the EPUs are graphics processing units (GPUs).

### Claim 3 (depends on 1)

The method of claim 1, wherein the EPUs comprise at least one of graphics processing units (GPUs), tensor processing units (TPUs) and central processing units (CPUs).

### Claim 4 (depends on 1)

The method of claim 1, wherein said sending, receiving and using are performed by a first network interface that connects the first EPU to the network.

### Claim 5 (depends on 4)

The method of claim 4, wherein the first EPU and the first network interface are in one housing unit.

### Claim 6 (depends on 4)

The method of claim 4, wherein the first EPU and the first network interface are on one printed circuit board.

### Claim 7 (depends on 4)

The method of claim 4, wherein the first EPU and the first network interface are in one chip package.

### Claim 8 (depends on 4)

The method of claim 4, wherein the first network interface is one of a plurality of network interfaces of the first EPU, each network interface comprising a plurality of ports each of which connects the first EPU through a different physical link to the network.

### Claim 9 (depends on 1)

The method of claim 1, wherein sending the scheduling request comprises sending the control message as an in-band control message to the second EPU, and receiving the set of scheduling parameters comprises receiving the set of scheduling parameters from the control plane agent instead of the second EPU.

### Claim 10 (depends on 9)

The method of claim 9, wherein in-band control and reply messages are data messages forwarded through a data plane of the network, wherein the data plane further carrying the EPU operation results among the EPUs.

### Claim 11 (depends on 9)

The method of claim 9, wherein
the network comprises data plane circuits that form a data plane for forwarding EPU operation results,
a data plane circuit intercepts the in-band control message and forwards the control message to the control plane agent, and
the control plane agent provides the set of scheduling parameters in lieu of the second EPU providing the set of scheduling parameters.

### Claim 12 (depends on 11)

The method of claim 11, wherein the control plane agent's provides the set of scheduling parameters as an in-band control message that is forwarded back to the first EPU through one or more data plane circuits of the network.

### Claim 13 (depends on 11)

The method of claim 11, wherein the data plane circuit that intercepts the control message is a data plane circuit of a last-hop forwarding element in a path through the network from the first EPU to the second EPU.

### Claim 14 (depends on 13)

The method of claim 13, wherein the control plane agent is a control plane circuit of the last-hop forwarding element.

### Claim 15 (depends on 13)

The method of claim 13, wherein the control plane agent is a control plane proxy server that receives the intercepted control message from the data plane circuit of the last-hop forwarding element.

### Claim 16 (depends on 1)

The method of claim 1, wherein the set of scheduling parameters specifies a timing parameter that specifies when the first result should be forwarded through the network to the second EPU.

### Claim 17 (depends on 1)

The method of claim 1, wherein the set of scheduling parameters specifies a rate parameter that specifies a rate for forwarding the first result through the network to the second EPU.

### Claim 18 (depends on 1)

The method of claim 1, wherein the control message identifies a data size of the first result that needs to be sent from the first EPU to the second EPU.
