Embedded operating system task switching method and unit

Abstract

The invention discloses a method and a unit for switching tasks in embedded operating systems, wherein the unit comprises a storage module and a stack management module; the storage module comprises a temporary work stack used for saving field data of a currently run task; the stack management module is used for determining and recording the size N of the filed data of the currently run task after receiving a task switching command, storing the filed data of the currently run task in a stack with the storage space size at least equal to N and recording the corresponding relation between the task and the stack. A technical proposal of the invention can solve the problem that the task stack wastes storage space, cannot waste any space basically, is more suitable for systems which are short of storage space and are not particularly frequent in switching. An optimization proposal of the invention can improve switching efficiency and save hardware resources.

Description

technical field [0001] The invention relates to an embedded operating system, in particular to a method and unit for switching tasks in the embedded operating system. Background technique [0002] An embedded operating system is an operating system software that supports embedded system applications. It is an extremely important part of an embedded system (including hardware and software systems), and usually includes hardware-related underlying driver software, system kernel, and device drivers. Interface, communication protocol, graphical interface, standardized browser browser, etc. Compared with general-purpose operating systems, embedded operating systems have more prominent features in terms of system real-time efficiency, hardware-related dependencies, software solidification, and application specificity. [0003] Interruption means that due to the occurrence of a certain event, the CPU suspends other programs currently being executed and executes a program that hand...

AI Technical Summary

Problems solved by technology

[0007] exist figure 2 In , an array variable is defined for each task as a stack. The size of the array is generally allocated according to the maximum stack required by the possible tasks. It is generally difficult to determine the maximum stack required by a task. It is generally determined based on empirical values, and the stack requires Make sure not

Images