Multi-task scheduling method and device of operating system
An operating system and task scheduling technology, applied in the communication field, can solve problems such as resource waste, achieve the effects of improving execution efficiency, solving task execution resource waste, and saving execution resources
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0023] The method embodiment provided in Embodiment 1 of the present application may be executed in a server, a computer terminal, or a similar computing device. Take running on the server as an example, figure 1 It is a hardware structural block diagram of a server of an operating system multi-task scheduling method according to an embodiment of the present invention. Such as figure 1 As shown, the server 10 may include one or more ( figure 1 Only one is shown in ) processor 102 (processor 102 may include but not limited to processing devices such as microprocessor MCU or programmable logic device FPGA) and memory 104 for storing data. Optionally, the above-mentioned server can also be A transmission device 106 for communication functions and an input and output device 108 are included. Those of ordinary skill in the art can understand that, figure 1 The shown structure is only for illustration, and it does not limit the structure of the above server. For example, server...
Embodiment approach
[0058]At present, when an operating system schedules multiple tasks, it usually uses an Earliest Deadline First (EDF) scheduling algorithm to determine the scheduling order of each task. In the multi-task scheduling process using this algorithm, according to the order of the deadlines corresponding to each task in the task queue, the task with the earliest deadline is preferentially selected for scheduling, and after the task with the earliest deadline is scheduled, the task is assigned to execute The task execution resource required to execute the task.
[0059] In the multi-task scheduling method in this embodiment, first, the adjacency matrix is used to represent the dependencies among the tasks, and then the tasks with dependencies are composed into task subsets, and then the task corresponding to each task in the task subsets can be successfully run A sequence of tasks that consists of all the tasks that the task depends on plus the task itself. After obtaining the tas...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


