Method for preventing low-priority tasks from starving based on multi-task system

Abstract

The invention relates to a technical scheme of a method for preventing low-priority tasks from starving in a multi-task system. The method comprises the following steps: adding corresponding starving time to each task in a ready queue in a CPU (Central Processing Unit); when the hunger time of any task reaches a hunger threshold value, adding the task to a hunger task queue; and sequentially executing the tasks entering the starvation task queue according to the priority through the scheduling clock. The method has the beneficial effects that each task only has a unique priority, the priority cannot be dynamically changed, and the management of an operating system is relatively convenient; when the clock is interrupted and returned, the starved task can be immediately scheduled and executed without waiting for the next scheduling time point, so that the starved task can be scheduled more timely; the hunger time threshold values of the tasks with different priorities and the hunger relieving threshold value of the hunger queue can be dynamically configured, and the requirements of different application scenes can be flexibly met.

Description

technical field [0001] The invention relates to the computer field, in particular to a method for preventing low-priority tasks from starving to death in a multi-task-based system. Background technique [0002] With the development of computer and electronic technology, multitasking operating systems have become an indispensable part of the IT field, and are widely used in servers, desktop computers, embedded systems and other fields. In small and medium-sized application scenarios, such as the embedded field, operating systems based on priority and time slices still play an important role. They continue to be favored by various application manufacturers for their advantages such as code simplification, high real-time performance, and low power consumption. [0003] refer to figure 1 , one of the main functions of the operating system is to perform task scheduling, that is, to manage various tasks and allocate processor resources to them according to the needs of actual ope...

AI Technical Summary

Problems solved by technology

This method first causes the priority of tasks to be confused. Each task has both original priority and dynamic priority, and the dynamic priority is changing, which is not conducive to the management of the operating system.

Secondly, the starving task still cannot be scheduled to run immediately, and must wait for the next scheduling time point. In the worst case, it has to wait for nearly a complete task time slice

Again, after the starved task is scheduled for execution, it will execute a complete time slice, which will cause other high-priority ready tasks to be unable to be scheduled and run in time, resulting in a long scheduling delay, and these high-priority tasks are often required Tasks that respond in a timely manner, such as responding to user touch screen operations, may cause freezes in a macro perspective, affecting the system experience

Images