Task scheduling method and device, electronic device and readable storage medium

Abstract

The invention provides a task scheduling method which comprises the following steps: acquiring at least one computing resource, creating at least one execution queue corresponding to each computing resource, and allocating a resource proportion of the corresponding computing resource for each execution queue; obtaining at least one task instance and task information of each task instance, and allocating each task instance to a specified execution queue of specified computing resources according to the task information; obtaining the selected probability of each candidate task instance according to the resource proportion of all available execution queues in the same computing resource; and selecting one candidate task instance from all the available execution queues corresponding to the same computing resource to operate according to the selected probability of each candidate task instance. According to the method, the priority is determined through the resource proportion of the execution queues, tasks are selected from different execution queues to be executed every time by adopting a polling mechanism, it is guaranteed that all task instances are sequentially executed according to the set priority in a classified mode, and it is also considered that the low-priority tasks still have the opportunity to be executed preferentially.

Description

technical field [0001] The present application relates to the field of computer technology, in particular to a task scheduling method, device, electronic device, and readable storage medium. Background technique [0002] With the rapid development of computer technology and Internet technology, users can easily access the Internet and submit tasks to servers on the Internet, and the server can provide users with corresponding services by executing the tasks submitted by users. However, when the server is accessed and used by a large number of users at the same time, the server will continuously receive task request instructions, usually save all task request instructions in the message queue, pile up the tasks, and then pass some scheduling strategies , continuously select a task from the message queue to execute. [0003] The patent application document with the publication number "CN107423120A" discloses a method and device for task scheduling, specifically setting the pr...

AI Technical Summary

Problems solved by technology

The disadvantage of this is that the tasks in the message queue with lower priority are difficult to be executed, and the tasks at the bottom of the message queue with lower priority are more difficult to be executed

Therefore, this task scheduling method not only considers a single factor, but also has low execution efficiency, and it is easy to ignore the tasks in the low-priority message queue, which reduces the user experience.

Images