Task scheduling method and device for embedded operating system and storage medium

Abstract

The invention discloses a task scheduling method of an embedded operating system. The method comprises steps of carrying out scheduling initialization, defining a scheduling mode with minimum idle time priority; wherein the difference between the task prediction completion time and the deadline is defined as idle time; adding the scheduling method into macro definition and placing at the head of ascheduling linked list, and performing priority ranking on the original scheduling mode of the embedded operating system again, so that the priority of the newly added scheduling mode is higher thanthat of the original scheduling algorithm; initializing a data structure and scheduling parameters, setting an additional algorithm scheduling running queue in the embedded operating system, and adding the running queue into a ready queue of a global scheduler; wherein all the task sets scheduled by defining the scheduling mode with the minimum idle time priority are arranged in an additional queue; and storing all tasks of the task set through a data structure of a red-black tree.

Description

technical field [0001] The invention relates to the technical field of computers, in particular to a task scheduling method, device and storage medium of an embedded operating system. Background technique [0002] The computing power of embedded devices is getting stronger and stronger. Many embedded devices have multimedia cameras (video shooting, photo continuous shooting or audio recording functions), and the real-time data obtained through the cameras are stored in the file system as ordinary files. Embedded devices usually support common file system formats (such as FAT12, FAT16, FAT32, NTFS, ExFAT, Ext2, Ext3, HFS, HFS+, etc.). The support of the general file system means that the files stored in the medium can be shared with other systems that support these file system formats without any format conversion. Therefore, when storing files and writing data, the storage devices must be accessed according to the format of the relevant file system and data organization rul...

AI Technical Summary

Problems solved by technology

[0004] When the multi-core processor system in the prior art runs the application program, most of them run with the thread as the scheduling unit. However, the inventor found in the research that in the current thread scheduling process, the thread to be switched is determined according to the priority of the thread. However, the resource competition or waste caused by the shared resources of the multi-core processor system is ignored, which leads to the performance degradation of the multi-core processor system.

The existing scheduling method based on multi-core processors performs load balancing among multiple processors as an after-the-fact adjustment behavior after the processor scheduling completes the tasks, but for unbalanced and imprecise task allocation among multiple processors before scheduling can't solve

Moreover, the related policies of CPU affinity can only be issued manually from the user space, and the scheduler can only schedule tasks according to the CPU affinity specified by the user space, but cannot realize the intelligent scheduling of the scheduler

Images