A processing unit task scheduling method and device

Abstract

The present invention relates to a processing unit task scheduling method and device, the method comprising: when the scheduling opportunity arrives, judging whether there is a forecast assertion for the idle processing unit involved in the scheduling opportunity; when predicting the assertion, acquiring the forecast assertion For the associated target task pair, the secondary task in the target task pair is scheduled to be executed on the idle processing unit; the main task is scheduled to be executed on the first processing unit after the prediction assertion is created. From the perspective of task demand estimation and hardware resource management, the present invention expands the scope of task and resource fusion by constructing target task pairs, and achieves good shared execution of tasks on the basis of task demand and hardware resources. Reach a balance, and finally improve the efficiency of processing unit task scheduling.

Description

A processing unit task scheduling method and device technical field The invention belongs to the technical field of integrated circuit design, particularly relate to a kind of processing unit task scheduling method and device set. Background technique [0002] Now microprocessor manufacturers have turned to the embrace of multi-processing unit technology. Additions to Multiprocessing Unit Technology The number of processing units opens up a new window for processor performance gains. As the number of processing units continues to increase, processing With the continuous complexity of the architecture of the processing unit, improving the efficiency of task scheduling in a system with multiple processing units has become a new research hotspot. Depend on Due to the introduction of multi-processing units, the relationship between processing nodes in a parallel system has been changed. In a traditional parallel system, the Each processing node is equal, and in a para...

AI Technical Summary

Problems solved by technology

There are many algorithms for dynamic process scheduling. Generally, the shortest task execution time is used as the scheduling goal, and the earliest end process is scheduled first. This method is very effective in the case of a single processing unit, but when the number of processing units is large, it will lead to A large number of processes are concentrated on a certain processor, resulting in unbalanced load

On the other hand, no matter what kind of task scheduling method in the existing technology, it is executed in order, and the current very sufficient computing resources are not fully utilized. Task scheduling still stays at the operating system level, and the information obtained to guide the scheduling direction is not enough. The bottom layer does not make full use of the dynamic performance parameters of the combination of tasks and computing resources displayed in the task scheduling process. Therefore, under the processing period structure with many processing units, from the perspective of processing unit resource management, further processing The scheduling of units to improve computing efficiency is still an unresolved problem;

Images