Task scheduling method and device

Abstract

Embodiments of the present application provide a task scheduling method and device, which belong to the field of data processing. The method includes: obtaining the actual number of packets processed by each core of at least two cores of the multi-core processor within a preset time period; according to the actual number of packets processed by each core within the preset time period the number of documents, and schedule at least one task block in the first core among the at least two cores to the second core, wherein the first actual task block processed by the first core within the preset time period The number of packets is greater than the second actual number of packets processed by the second core within the preset time period. In this solution, the scheduling of task blocks between multiple cores is realized based on the actual number of processed packets of each core, so that the effective running workload of each core task can be counted more accurately, and then More effectively distribute tasks among multiple cores to achieve the optimal performance of the system as a whole.

Description

technical field [0001] The present application relates to the field of data processing, and in particular, to a task scheduling method and device. Background technique [0002] In Network Function Virtualization (NFV for short) systems, in order to achieve the ultimate performance of data processing, most of the following technologies are used: polling processing is used instead of interrupt notification to eliminate interrupt overhead; each core of the multi-core processor Bind only one polling processing thread to eliminate task scheduling overhead among multiple cores. However, some processing steps in the data processing flow may not necessarily be assigned to fixed cores, such as Qos dequeue operation, there may be thousands of queues that need to be dequeued, and these dequeue processes need to be assigned to different cores. The usual practice is to divide these different processing steps in the message processing flow into basic task blocks, which are collectively c...

AI Technical Summary

Problems solved by technology

[0003] However, the load of each core calculated by the existing method is the same, so the jobs in each core cannot be scheduled, and in practical applications, the load of each core is unbalanced, so, It is impossible to achieve load balancing of each core by implementing job scheduling through existing methods.

Images