Task scheduling method and device, computer equipment and storage medium

Abstract

The invention relates to a task scheduling method and device, computer equipment and a storage medium. The method comprises the following steps: mapping tasks in a task set to corresponding processorsin a processor set according to a mapping relationship; respectively dividing each task mapped to the same processor into corresponding threads; according to a preset scheduling mode, obtaining the execution sequence of the tasks divided into the threads, wherein the preset scheduling mode comprises at least one of a global scheduling mode, a local scheduling mode and a static scheduling mode. Byadopting the method, the tasks in the task set can be mapped to the corresponding processors in the processor set; then, each task is divided into corresponding threads; the execution sequence of thetasks in each thread is obtained according to the preset scheduling mode, so that the processor can correspondingly execute the corresponding tasks according to the execution sequence, deadlock of the processor in the task processing process is avoided, and the task processing performance of the processor can be improved to the maximum extent.

Description

technical field [0001] The present application relates to the technical field of processor task processing, and in particular to a task scheduling method, device, computer equipment and storage medium. Background technique [0002] As the integrated circuit manufacturing process continues to approach the limit of Moore's Law, the integration of chips is getting higher and higher, and it is becoming more and more difficult to improve the performance of multi-core systems only from the perspective of process technology. Make improvements. [0003] Traditional task allocation techniques include dynamic allocation. Dynamic allocation refers to the allocation method in which task allocation occurs during application execution. It usually uses a fast heuristic algorithm to balance system resources and processor loads, because dynamic scheduling cannot determine the call time, so It is impossible to obtain the global optimal scheduling result from a global perspective, which leads...

AI Technical Summary

Problems solved by technology

[0003] Traditional task allocation techniques include dynamic allocation. Dynamic allocation refers to the allocation method in which task allocation occurs during application execution. It usually uses a fast heuristic algorithm to balance system resources and processor loads, because dynamic scheduling cannot determine the call time, so It is impossible to obtain the global optimal scheduling result from a global perspective, which leads to deadlocks in the processor during task processing and reduces the task processing performance of the processor

Images