# US 2026/0099308 A1 · Application programming interface to remove dependencies

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

- Number: US 2026/0099308 A1
- Document ID: US20260099308A1
- Status: Published application
- Kind: A1
- Application number: 19/348,654
- Filed: 2025-10-02
- Published: 2026-04-09
- Earliest claimed: 2023-02-27
- Assignees: NVIDIA Corporation
- Applicants: NVIDIA Corporation
- Inventors: David Anthony Fontaine; Steven Arthur Gurfinkel
- Web page: https://patentgrep.com/patent/US20260099308A1

## CPC

- G06F 8/433: {Dependency analysis; Data or control flow analysis}
- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F 9/5038: {considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration (scheduling strategies G06F9/4881 and subgroups)}
- 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 9/52: Program synchronisation; Mutual exclusion, e.g. by means of semaphores
- G06F 9/522: {Barrier synchronisation}
- G06F 2209/484: Precedence
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Apparatuses, systems, and techniques to perform an application programming interface (API) to remove one or more dependencies from a software graph, wherein the API is to cause one or more dependencies between two or more graph nodes to be removed to a software graph based, at least in part, on a dependency type indicated by the API. In at least one embodiment, one or more dependencies are removed from a graph in accordance to one or more dependency types.

## Claims

### Claim at position 1

1-20. (canceled)

### Claim 21

One or more processors, comprising:
circuitry to, in response to an application programming interface (API) call, remove one or more dependencies between two or more graph nodes from a software graph by removing one or more edges having a dependency type indicated using a data structure provided as an input parameter of the API call, wherein the dependency type indicates one or more constraints on scheduling a processor to perform a first operation corresponding to a first graph node and a second operation corresponding to a second graph node.

### Claim 22 (depends on 21)

The processor of claim 21, wherein the circuitry is to remove the one or more dependencies, in response to the API call, based, at least in part, on the one or more constraints on scheduling indicated by the dependency type.

### Claim 23 (depends on 21)

The processor of claim 21, in response to the API call, an indication of the software graph is to be received.

### Claim 24 (depends on 21)

The one or more processors of claim 21, wherein, in response to the API call, the one or more dependencies are to be removed from the software graph by identifying one or more source nodes and one or more destination nodes of the two or more graph nodes, wherein the one or more destination nodes comprising an indication of one or more nodes to which a dependency is to be removed.

### Claim 25 (depends on 21)

The one or more processors of claim 21, wherein the one or more dependencies are removed based on having a type corresponding to the dependency type specified in a plurality of dependency types, wherein the plurality of dependency types includes one or more of a full execution dependency, a launch order dependency, or an anti-deadlock dependency.

### Claim 26 (depends on 21)

The one or more processors of claim 21, wherein the two or more graph nodes are to be performed by one or more graphics processing units (GPUs).

### Claim 27 (depends on 21)

The one or more processors of claim 21, wherein, the API call is to receive a set of parameters comprising an identifier of a graph node and dependency information corresponding to the dependency type.

### Claim 28

A computer-implemented method comprising:
removing, in response to an application programming interface (API) call, one or more dependencies between two or more graph nodes from a software graph by removing one or more edges having a dependency type indicated using a data structure provided as an input parameter of the API call, wherein the dependency type indicates one or more constraints on scheduling a processor to perform a first operation corresponding to a first graph node and a second operation corresponding to a second graph node.

### Claim 29 (depends on 28)

The computer-implemented method of claim 28, further comprising, removing the one or more dependencies, in response to the API call, based, at least in part, on the one or more constraints on scheduling indicated by the dependency type.

### Claim 30 (depends on 28)

The computer-implemented method of claim 28, wherein, in response to the API call, an indication of the software graph is to be received.

### Claim 31 (depends on 28)

The computer-implemented method of claim 28, wherein, in response to the API call, the one or more dependencies are to be removed from the software graph by identifying one or more source nodes and one or more destination nodes of the two or more graph nodes, wherein the one or more destination nodes comprising an indication of one or more nodes to which a dependency is to be removed.

### Claim 32 (depends on 28)

The computer-implemented method of claim 28, wherein the one or more dependencies are removed based on having a type corresponding to the one or more dependencies specified in a plurality of dependency types, wherein the plurality of dependency types includes one or more of a full execution dependency, a launch order dependency, or an anti-deadlock dependency.

### Claim 33 (depends on 28)

The computer-implemented method of claim 28, wherein the two or more graph nodes are to be performed by one or more graphics processing units (GPUs).

### Claim 34 (depends on 28)

The computer-implemented method of claim 28, wherein, the API call is to receive a set of parameters comprising an identifier of a graph node and dependency information corresponding to the dependency type.

### Claim 35

A computer system comprising:
one or more processors and memory storing executable instructions that, if performed by the one or more processors, are to, in response to an application programming interface (API) call, remove one or more dependencies between two or more graph nodes from a software graph by removing one or more edges having a dependency type indicated using a data structure provided as an input parameter of the API call, wherein the dependency type indicates one or more constraints on scheduling a processor to perform a first operation corresponding to a first graph node and a second operation corresponding to a second graph node.

### Claim 36 (depends on 35)

The computer system of claim 35, wherein the one or more processors are to remove the one or more dependencies, in response to the API call, based, at least in part, on the one or more constraints on scheduling indicated by the dependency type.

### Claim 37 (depends on 35)

The computer system of claim 35, wherein, in response to the API call, an indication of the software graph is to be received.

### Claim 38 (depends on 35)

The computer system of claim 35, wherein, in response to the API call, the one or more dependencies are to be removed from the software graph by identifying one or more source nodes and one or more destination nodes of the two or more graph nodes, wherein the one or more destination nodes comprising an indication of one or more nodes to which a dependency is to be removed.

### Claim 39 (depends on 35)

The computer system of claim 35, wherein the one or more dependencies are removed based on having a type corresponding to the dependency type specified in a plurality of dependency types, wherein the plurality of dependency types includes one or more of a full execution dependency, a launch order dependency, or an anti-deadlock dependency.

### Claim 40 (depends on 35)

The computer system of claim 35, wherein, in response to the API call, a set of parameters comprising an identifier of a graph node and dependency information corresponding to the dependency type is to be received.
