US 12,443,449 B2
Techniques for modifying an executable graph to perform a workload associated with a new task graph
Steven Gurfinkel, Santa Clara, CA (US); Stephen Jones, San Francisco, CA (US); David Fontaine, Mountain View, CA (US); Sally Stevenson, Santa Clara, CA (US); Parag Kulkarni, Pune (IN); Jason Gaiser, Campbell, CA (US); Deyu Fu, Santa Clara, CA (US); Sharan Chetlur, San Jose, CA (US); and Kexin Yu, Sunnyvale, CA (US)
Assigned to NVIDIA Corporation, Santa Clara, CA (US)
Filed by NVIDIA CORPORATION, Santa Clara, CA (US)
Filed on Dec. 31, 2019, as Appl. No. 16/732,014.
Claims priority of application No. 201941046676 (IN), filed on Nov. 15, 2019.
Prior Publication US 2021/0149734 A1, May 20, 2021
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 9/50 (2006.01); G06F 9/445 (2018.01)
CPC G06F 9/5027 (2013.01) [G06F 9/44568 (2013.01)] 21 Claims
OG exemplary drawing
 
1. A non-transitory computer-readable medium that includes instructions that, when executed by one or more processors, cause the one or more processors to execute at least one application programming interface (API) call to modify a processor-executable version of a first task graph by applying one or more parameters of a non-processor-executable version of a second task graph to the processor-executable version of the first task graph to cause the modified processor-executable version of the first task graph to use one or more computing resources to perform one or more tasks differently than the processor-executable version of the first task graph before modification.