# US 2026/0089117 A1 · Using different types of scheduling to forward endpoint processing unit computation results through a network connecting a plurality of 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/0089117 A1
- Document ID: US20260089117A1
- Status: Published application
- Kind: A1
- Application number: 19/227,477
- 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/US20260089117A1

## 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 executing a distributed application with multiple EPUs that perform computations for the distributed application. The EPUs are associated with network interfaces that connect the EPUs to forwarding elements that form a network for connecting the EPUs. The method configures a set of network interfaces of a set of EPUs to forward, to a set of forwarding elements, results of a first set of computations after completion of the first set of computations. The method configures the set of network interfaces of the set of EPUs (i) to request scheduling parameters for forwarding results of a second set of computations after completing the second plurality of computations, and (ii) to forward the results of the second set of computations to the set of forwarding elements based on the requested scheduling parameters.

## Claims

### Claim 1

A method of executing a distributed application with a plurality of endpoint processing units (EPUs) that perform computations for the distributed application, the EPUs associated with network interfaces that connect the EPUs to a plurality of forwarding elements that form a network for connecting the EPUs, the method comprising:
configuring a set of network interfaces of a set of EPUs to forward, to a set of forwarding elements, results of a first plurality of computations after completion of the first plurality of computations; and
configuring the set of network interfaces of the set of EPUs (i) to request scheduling parameters for forwarding results of a second plurality of computations after completing the second plurality of computations, and (ii) to forward the results of the second plurality of computations to the set of forwarding elements based on the requested scheduling parameters.

### 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 the first plurality of computations comprises computations that the set of network interfaces identify as high priority computations.

### Claim 5 (depends on 1)

The method of claim 1, wherein the first plurality of computations comprises computations that the set of network interfaces identify as a first type of high priority computations that produce results that are smaller than a threshold amount.

### Claim 6 (depends on 5)

The method of claim 5, wherein the second plurality of computations comprises computations that the set of network interfaces identify as a second type of high priority computations that produce results that are larger than the threshold amount.

### Claim 7 (depends on 5)

The method of claim 5, wherein the second plurality of computations comprises computations that the set of network interfaces identify as a second type of high priority computations (i) that produce results that are larger than the threshold amount and (ii) for which the set of network interfaces has not received a set of scheduling parameters for forwarding results of the second type of high priority computations through the network.

### Claim 8 (depends on 7)

The method of claim 7, wherein the set of scheduling parameters comprise at least one of time and rate for forwarding the results of the second type of high priority computations.

### Claim 9 (depends on 1)

The method of claim 1, wherein the second plurality of computations comprises computations that the set of network interfaces identify as computations for which the set of network interfaces has not received a set of scheduling parameters for forwarding the computation results through the network.

### Claim 10 (depends on 9)

The method of claim 9, wherein the set of scheduling parameters comprise at least one of time and rate for forwarding the results of the second type of high priority computations.

### Claim 11 (depends on 1)

The method of claim 1, wherein the first and second plurality of computations are respectively first and second types of computations.

### Claim 12 (depends on 11)

The method of claim 11, wherein the first type is a small transaction type and the second type is a large transaction type.

### Claim 13 (depends on 12)

The method of claim 12, wherein a small transaction type is a computation that is associated with a small transaction that is performed by a smaller, first number of EPUs, while a larger transaction type is a computation that is associated with a larger transaction that is performed by a larger, second number of EPUs.

### Claim 14

A non-transitory machine readable medium storing a program for configuring network interfaces of a plurality of endpoint processing units (EPUs) that perform computations for a distributed application, the network interfaces connecting the EPUs to a plurality of forwarding elements that form a network to connect the EPUs, the program comprising sets of instructions for:
configuring a set of network interfaces of a set of EPUs to forward, to a set of forwarding elements, results of a first plurality of computations after completion of the first plurality of computations; and
configuring the set of network interfaces of the set of EPUs (i) to request scheduling parameters for forwarding results of a second plurality of computations after completing the second plurality of computations, and (ii) to forward the results of the second plurality of computations to the set of forwarding elements based on the requested scheduling parameters.

### Claim 15 (depends on 14)

The non-transitory machine readable medium of claim 14, wherein the EPUs are graphics processing units (GPUs).

### Claim 16 (depends on 14)

The non-transitory machine readable medium of claim 14, wherein the EPUs comprise at least one of graphics processing units (GPUs), tensor processing units (TPUs) and central processing units (CPUs).

### Claim 17 (depends on 14)

The non-transitory machine readable medium of claim 14, wherein the first plurality of computations comprises computations that the set of network interfaces identify as high priority computations.

### Claim 18 (depends on 14)

The non-transitory machine readable medium of claim 14, wherein the first plurality of computations comprises computations that the set of network interfaces identify as a first type of high priority computations that produce results that are smaller than a threshold amount.

### Claim 19 (depends on 18)

The non-transitory machine readable medium of claim 18, wherein the second plurality of computations comprises computations that the set of network interfaces identify as a second type of high priority computations that produce results that are larger than the threshold amount.

### Claim 20 (depends on 18)

The non-transitory machine readable medium of claim 18, wherein the second plurality of computations comprises computations that the set of network interfaces identify as a second type of high priority computations (i) that produce results that are larger than the threshold amount and (ii) for which the set of network interfaces has not received a set of scheduling parameters for forwarding results of the second type of high priority computations through the network.
