Task scheduling processing method and device and computer equipment

Abstract

The invention relates to a task scheduling processing method and device and computer equipment. The method comprises the steps of constructing a directed acyclic graph based on a dependency relationship between tasks, constructing a task scheduling queue by performing deep traversal on the constructed directed acyclic graph, and finally controlling scheduling and execution of the tasks based on the dependency relationship between the task scheduling queue and the tasks. The different tasks with the dependency relationship are executed in series according to the dependency relationship, and atleast part of the different tasks without the dependency relationship is executed in parallel. Based on a directed acyclic graph capable of reflecting a task dependency relationship, at least part ofthe different tasks are executed without the dependency relationship in parallel. The utilization rate of computing resources can be increased to a certain extent. Meanwhile, computing efficiency of the tasks is improved, in addition, the dependent tasks are executed in series according to the dependency relationship between the tasks, repeated execution of the tasks on the dependent preposed tasks is avoided, and the task execution efficiency is further improved.

Description

technical field [0001] The present application belongs to the technical field of task scheduling, and in particular relates to a task scheduling processing method, device and computer equipment. Background technique [0002] In the feature analysis task of the recommendation model, such as the feature analysis task of the Daily Express recommendation model, it is usually necessary to calculate a series (such as a dozen) different feature indicators. For the feature indicator calculation task, the current solution is to For the calculated multiple characteristic indexes, the calculation tasks of different characteristic indexes are respectively performed in a serial manner. [0003] In the above-mentioned serial method, different computing tasks need to be queued up for execution in turn, and the waiting of tasks in the queue will easily lead to idle computing resources, which will lead to the defects of low utilization of computing resources and low efficiency of task comput...

AI Technical Summary

Problems solved by technology

[0003] In the above-mentioned serial method, different computing tasks need to be queued up for execution in turn, and the waiting of tasks in the queue will easily lead to idle computing resources, which will lead to the defects of low utilization of computing resources and low computing efficiency of tasks.

Images