| CPC G06F 9/3836 (2013.01) [G06F 9/4881 (2013.01)] | 20 Claims |

|
1. A computing graph runtime scheduling method, wherein a computing graph is a compiled computing graph, and the compiled computing graph comprises a plurality of execution blocks, the execution blocks represent child operations of each node in the computing graph, the method comprising:
storing information about an execution block that is required to be executed in the compiled computing graph in response to the preparatory execution of the execution block when the compiled computing graph is run, so as to construct a runtime computing graph; and
scheduling the stored execution block based on the runtime computing graph according to dependencies, so as to implement pipeline operations.
|