Tasks delayed time processing method and system in real-time operating system

Abstract

The invention discloses a tasks delay processing method in real-time operating systems, comprising steps as follows: when delay queue is empty, current tasks needing time delay are added into the delayed queue; otherwise, the current tasks are added into the delayed queue according to an ascending order of the absolute delay time of the tasks, and relative delay time between the adjacent tasks in the delayed queue is calculated; when a clock cycle comes, whether the delay time of the first task in the delayed queue reaches a clock cycle is judged; If a clock cycle is reached, the first task and closely following task with zero relative delay time are removed from the delayed queue; otherwise, a clock cycle is deducted from the delay time of the first task. Besides, the invention also discloses a tasks delay processing system in real-time operating systems; and has the advantages of improving the response time and enhancing the real time for systems.

Description

technical field [0001] The invention relates to a real-time operating system, in particular to a task delay processing method and system in the real-time operating system. Background technique [0002] A real-time operating system is a system that can complete system functions within a specified or determined time and respond to external and internal events in synchronous or asynchronous time. In a real-time operating system, the correctness of operations depends not only on the correctness of the logic design, but also on the time when these operations run. That is to say, the real-time system has very strict requirements on logic and timing. , there will be serious consequences. [0003] In order to provide real-time support, the real-time operating system must effectively schedule and manage CRUs and other resources, that is, real-time scheduling. The states of each task (the task can be a thread) in a real-time operating system mainly include a ready state, a running s...

AI Technical Summary

Problems solved by technology

It can be seen that in the prior art, every time a clock cycle occurs, it is necessary to scan from the head to the end of the delay queue. In addition, the frequency of clock cycles is usually very frequent. If the delay queue is relatively long, the burden on the system will be very large. If it is large, it will affect the response time of task scheduling and reduce the real-time performance

Images