Task scheduling method and device

Abstract

The invention discloses a task scheduling method and a device. The task scheduling method comprises the following steps: task lists of all times in unit periods are built; the task list of present time is scanned in each time of each unit period; task records scanned at present are taken out; task period identifiers of the task records are minus 1; if the task period identifiers minus 1 are greater than 0, the task records are put in the task list of the present time; if the task period identifiers minus 1 are equal to 0, tasks appointed by the task records are executed, and the time of executing the tasks at the next time and initial task period identifiers are determined; the task records and corresponding initial task period identifiers are added in the task list of the time of executing the tasks at the next time. The task scheduling method can automatically form the task scheduling plan to realize the transparent management of task execution and improve the task list scanning efficiency, and can form a more complex task scheduling mode by using task scheduling rules therein.

Description

technical field [0001] The invention relates to computer technology, in particular to a task scheduling method and device. Background technique [0002] Task scheduling is an important part of the operating system, and for real-time operating systems, task scheduling directly affects its real-time performance. In computer systems and various software systems, there are various task scheduling scenarios. Among them, in the task scheduling process, there are many scenarios based on time scheduling. In these scenarios, it is necessary to realize the function of running the task program at a specific time point or time interval. [0003] Such as figure 1 As shown, an existing task scheduling process includes: [0004] 1), in the current time period or at the current specific time point, the task scheduler scans the task list, and then enters step 2); [0005] 2), select the task to be performed in the task list, and then enter step 3); [0006] 3), start to execute the sele...

AI Technical Summary

Problems solved by technology

[0011] First, when the existing scheduling scheme uses Java scheduling components to implement task scheduling, it can only perform serial execution of tasks, but cannot perform parallel execution of tasks, which makes the task scheduling process inefficient;

[0012] Second, in the existing scheduling scheme, the task list must be re-scanned every time the scheduling is executed. In the case of a large number of tasks, it takes a long time to scan the scheduling list, which also makes the task scheduling process inefficient;

[0013] Third, the existing scheduling scheme cannot view the task information that needs to be executed at any time, and cannot realize the transparent management of task execution

[0014] Therefore, there is still room for further improvement in the existing scheduling scheme

Images