Back to results
US 12,717,561 B1Granted
Application programming interface to remove dependencies
AssigneeNVIDIA Corporation
InventorsDavid Anthony Fontaine, Steven Arthur Gurfinkel
Life of this patent
Estimating the term…
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.
Claims20
One or more processors, comprising:
- circuitry to, in response to an application programming interface (API) call, cause one or more dependencies between two or more graph nodes to be removed from a software graph based, at least in part, on a dependency type, specified from a plurality of dependency types, 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 of the two or more graph nodes, wherein the plurality of dependency types includes one or more of a full execution dependency, a launch order dependency, or an anti-deadlock dependency.
A computer-implemented method comprising:
- in response to an application programming interface (API) call, causing one or more dependencies between two or more graph nodes to be removed from a software graph based, at least in part, on a dependency type specified from a plurality of dependency types 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 of the two or more graph nodes, wherein the plurality of dependency types includes one or more of a full execution dependency, a launch order dependency, or an anti-deadlock dependency.
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, cause one or more dependencies between two or more graph nodes to be removed from a software graph based, at least in part, on a dependency type specified from a plurality of dependency types 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 of the two or more graph nodes, wherein the plurality of dependency types includes one or more of a full execution dependency, a launch order dependency, or an anti-deadlock dependency.
Dependencies are inferred from the claim text.