# US 2019/0319867 A1 · Optimized job scheduling and execution in a distributed computing grid

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

- Number: US 2019/0319867 A1
- Document ID: US20190319867A1
- Status: Published application
- Kind: A1
- Application number: 16/449,044
- Filed: 2019-06-21
- Published: 2019-10-17
- Earliest claimed: 2004-01-27
- Assignees: AT&T Intellectual Property II, L.P.
- Applicants: AT&T Intellectual Property II, L.P.
- Inventors: Joseph B. Weinman, JR.
- Web page: https://patentgrep.com/patent/US20190319867A1

## CPC

- G06F 9/5027: {the resource being a machine, e.g. CPUs, Servers, Terminals}
- G06F 9/4843: {by program, e.g. task dispatcher, supervisor, operating system}
- G06F 9/5044: {considering hardware capabilities}
- G06F 9/5083: {Techniques for rebalancing the load in a distributed system}
- H04L 43/0882: Utilisation of link capacity
- H04L 47/125: by balancing the load, e.g. traffic engineering
- H04L 49/9023: for implementing a jitter-buffer
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Disclosed example methods for scheduling a computer-executable job include determining valid combinations of nodes and links from a network of nodes interconnected by links, the valid combinations of nodes and links having capability and capacity to complete the computer-executable job; determining, from the valid combinations of nodes and links, first combinations of nodes and links based on a total cost associated with execution of the computer-executable job on corresponding ones of the valid combinations of nodes and links; selecting one of the first combinations of nodes and links based on a load balancing status between the first combinations of nodes and links; and scheduling the computer-executable job to be executed by the one of the first combinations of nodes and links.

## Claims

### Claim 1

A method, comprising:
determining, by a system including a processor, valid combinations of nodes and links from a network of nodes interconnected by links, the valid combinations of nodes and links having a capability and capacity to complete a computer-executable job;
determining, by the system, from the valid combinations of nodes and links, first combinations of nodes and links based on a total cost associated with execution of the computer-executable job on corresponding ones of the valid combinations of nodes and links;
selecting, by the system, one of the first combinations of nodes and links based on a load balancing status between the first combinations of nodes and links; and
scheduling, by the system, the computer-executable job to be executed by the one of the first combinations of nodes and links.
