Dynamic priority scheduling algorithm based on linux real-time operating system

Abstract

The invention relates to a dynamic priority scheduling algorithm based on a linux real-time operating system. The algorithm comprises the following steps of when a real-time task is added into a taskqueue, updating current recovery time and acquiring the state of a current task, and storing the real-time task into a cache memory module; when the real-time task overruns, calling an SLAD or BACKSLASH algorithm, and counting in the cache memory module; otherwise calling an EDF algorithm and counting in the cache memory module; computing overrunning frequency of the real-time ask within a set time slot by using the cache memory module; determining to directly schedule the SLAD or BACKSLASH algorithm, or schedule the EDF algorithm according to the overrunning frequency of the real-time ask, and updating a task priority and next recovery time. Therefore, advantages of the EDF algorithm are effectively utilized when a normal task load is processed, and the algorithm is prone to implement andoccupies fewer processor resources.

Description

technical field [0001] The invention belongs to the technical field of real-time operating systems, and in particular relates to a dynamic priority scheduling algorithm based on a linux real-time operating system. Background technique [0002] Among many real-time operating systems, Linux-based real-time operating systems are increasingly popular due to the open source code and the stability of Linux systems. But Linux itself is not a real real-time operating system. It must improve its real-time performance by making corresponding improvements to the Linux operating system, so that it has the real-time and reliability that meet the requirements of real-time systems. [0003] The correct behavior of a real-time system depends not only on the correctness of the settlement result, but also on the time it takes to obtain this result. The fundamental properties of real-time systems are the determinism of task response time and the high throughput of system processing tasks. Th...

AI Technical Summary

Problems solved by technology

This will take up processor resources, and when real-time task overruns are not frequent; this kind of scheduling is not efficient

[0009] It can be seen from the above that when the above two types of algorithms are applied to the Linux real-time operating system alone, they cannot meet the real-time and reliability requirements of the real-time system.

Images