Directed acyclic graph processing method and device, equipment, medium and program product

The invention provides a processing method and device of a directed acyclic graph, equipment, a medium and a program product. The method comprises the following steps: acquiring award values of all task nodes on a path from a root node of the directed acyclic graph to a current task node through simulation scheduling; obtaining an accumulated value of execution time of task nodes on an unscheduled critical path in the directed acyclic graph on a processor which completes a task at the fastest speed; and pruning the directed acyclic graph according to the reward value and the accumulated value. According to the method, the value of the task node can be evaluated more comprehensively through the accumulated value of the reward value and the execution time, and then the value is used as a pruning basis for pruning processing, so that some nodes with poor scheduling effects can be removed, the search range of the directed acyclic graph is narrowed, the search efficiency is improved, the calculation complexity is